Sharp quadratic χ-binding for powers of bipartite graphs
Statement
For every integer , does there exist a constant and an infinite family of bipartite graphs such that and for all , where is the th graph power? Equivalently, is the known quadratic upper bound asymptotically sharp for every ?
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.