Small blow-up conjecture for triangle covers
Statement
Let be a graph, and for a positive integer let denote the graph obtained by replacing every vertex of with an independent set of size , with edges between replacement sets corresponding to edges of . A graph is covered with triangles if its vertices can be partitioned into vertex-disjoint copies of the triangle . Small blow-up conjecture. If both and can be covered with triangles, then itself can be covered with triangles.
This conjecture would eliminate the phrase “if is large enough” from the proof of the tripartite Corrádi–Hajnal theorem, yielding the theorem with no lower-bound requirement on .
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.