The deletion-normality conjecture for non-complete graphs
Statement
For a graph , an -deletion-saturated graph is an -free graph with such that, for every , the graph is not -free. A graph is deletion-normal if there exists an -deletion-saturated graph. Likewise, is addition-normal if there exists an -free graph with such that is not -free for every . Deletion-normality conjecture. Every non-complete graph is deletion-normal. Equivalently, every non-edgeless graph is addition-normal. Complete graphs on at least two vertices are the only graphs currently known not to be deletion-normal, while edgeless graphs on at least two vertices are the only graphs currently known not to be addition-normal; the conjecture is proved for several classes, including complete bipartite graphs with unequal part sizes, triangle-free unicyclic graphs, graphs with two leaves at distance at most three, and line graphs of trees.
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.