Chromatic number conjecture for matching graphs
Statement
Let be a connected graph, let be a positive integer, and let denote the maximum number of edges in an -free subgraph of . The matching graph has vertices corresponding to the copies of in , with adjacency given by edge-disjointness. Chromatic number conjecture. For every connected graph and every positive integer , one has
This conjecture proposes an exact formula for the chromatic number of matching graphs in terms of the extremal number of edges in an -free subgraph. The surrounding results establish the formula for several classes, including suitable complete bipartite graphs, but the general case remains open.
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.