ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and for a positive integer tt let G(t)G(t) denote the graph obtained by replacing every vertex of GG with an independent set of size tt, with edges between replacement sets corresponding to edges of GG. A graph is covered with triangles if its vertices can be partitioned into vertex-disjoint copies of the triangle K3K_3. Small blow-up conjecture. If both G(t)G(t) and G(t+1)G(t+1) can be covered with triangles, then GG itself can be covered with triangles.

This conjecture would eliminate the phrase “if NN is large enough” from the proof of the tripartite Corrádi–Hajnal theorem, yielding the theorem with no lower-bound requirement on NN.

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.