Gyárfás–Sumner conjecture
Statement
For a graph , let denote its chromatic number, i.e. the least number of colours in a proper vertex colouring of . For graphs and , say that is -free if no induced subgraph of is isomorphic to ; here an induced subgraph of is a graph with , having vertex set and all edges of with both ends in . Let denote the complete graph on vertices, and let a tree be a finite connected acyclic graph.
For every tree and every integer there exists a constant such that
for every graph that is both -free and -free.
Equivalently: for every tree and every integer there exists such that every -free graph with contains as an induced subgraph.
Record
- Added
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.