The common blow-up conjecture for K4-free graphs
Statement
A blow-up of a graph is obtained by replacing each vertex of by a non-empty independent set, possibly of a different size, and joining two such sets exactly when their corresponding vertices are adjacent in . Common blow-up conjecture. If is non-empty and -free, then there exists a blow-up of which is common. The conjecture is presented as a natural approach toward the broader -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.