ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph HH, an HH-deletion-saturated graph is an HH-free graph GG with E(G)≠∅E(G)\neq\varnothing such that, for every e∈E(G)e\in E(G), the graph G−eG-e is not HH-free. A graph HH is deletion-normal if there exists an HH-deletion-saturated graph. Likewise, HH is addition-normal if there exists an HH-free graph GG with E(G‾)≠∅E(\overline{G})\neq\varnothing such that G+eG+e is not HH-free for every e∈E(G‾)e\in E(\overline{G}). Deletion-normality conjecture. Every non-complete graph HH is deletion-normal. Equivalently, every non-edgeless graph HH 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 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.