ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A blow-up of a graph FF is obtained by replacing each vertex of FF by a non-empty independent set, possibly of a different size, and joining two such sets exactly when their corresponding vertices are adjacent in FF. Common blow-up conjecture. If FF is non-empty and K4K_4-free, then there exists a blow-up of FF which is common. The conjecture is presented as a natural approach toward the broader K4K_4-barrier conjecture; the supplied text gives evidence for the broader claim but no resolution of this blow-up version.

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.