ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite undirected simple graph.

A kk-page book embedding of GG consists of a linear order ⪯\preceq of V(G)V(G) and a (non-proper) kk-colouring of E(G)E(G) such that edges with the same colour do not cross with respect to ⪯\preceq. That is, if v≺x≺w≺yv\prec x\prec w\prec y for some edges vw,xy∈E(G)vw,xy\in E(G), then vwvw and xyxy receive distinct colours.

One can think that the vertices are placed along the spine of a book, and the edges are drawn without crossings on the pages of the book.

The book thickness of GG, denoted by bt (G)(G) is the minimum integer kk for which there is a kk-page book embedding of GG.

Let G′G' be the graph obtained by subdividing each edge of GG exactly once.

Conjecture There is a function ff such that for every graph GG, bt(G)≤f(bt(G′)).\text{bt}(G) \leq f( \text{bt}(G') )\enspace.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.