Additionally the authors of [7] observed that the number of vertices of the graphs Gℓ from Theorem 3 is exponential in their treewidth, while for walls and their line graphs,…
Statement
Additionally the authors of [7] observed that the number of vertices of the graphs Gℓ from Theorem 3 is exponential in their treewidth, while for walls and their line graphs, the number of vertices is polynomial in the treewidth. This radical difference lead to the following conjecture. Theorem 5. [2] For every subdivided cubic caterpillar T , every graph with bounded maximum degree and sufficiently large treewidth contains either a subdivision of T or the line graph of a subdivision of T as an induced subgraph. Conjecture 6 ([7]). There exists a constant c such that if G is a (theta, triangle)- free graph, then tw(G) ⩽ c log(|V (G)|).
Record
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.