For all positive integers k and \ell, do there exist functions f(k,\ell) and s(k) such that every graph G with \chi(G)\geq f(k,\ell) has a subgraph G' for which either…
Statement
For all positive integers k and \ell, do there exist functions f(k,\ell) and s(k) such that every graph G with \chi(G)\geq f(k,\ell) has a subgraph G' for which either \chi(G')\geq k and G' has no odd cycle of length at most \ell, or G' contains a K_k whose edges are each subdivided by at most s(k) vertices?
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.