ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph, let rr be a positive integer, and let ex(G,rK2){\rm ex}(G,rK_2) denote the maximum number of edges in an rK2rK_2-free subgraph of GG. The matching graph KG(G,rK2){\rm KG}(G,rK_2) has vertices corresponding to the copies of rK2rK_2 in GG, with adjacency given by edge-disjointness. Chromatic number conjecture. For every connected graph GG and every positive integer rr, one has

χ(KG(G,rK2))=∣E(G)∣−ex(G,rK2).\chi({\rm KG}(G,rK_2))=|E(G)|-{\rm ex}(G,rK_2).

This conjecture proposes an exact formula for the chromatic number of matching graphs in terms of the extremal number of edges in an rK2rK_2-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.