ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a simple graph, where VV is its vertex set. A graph is critically ss-chromatic if it has chromatic number ss and deleting any vertex lowers its chromatic number. For a subset W⊆VW\subseteq V, let G[W]G[W] denote the graph obtained by expanding successively at the vertices in WW, where expansion at a vertex xx adds a new vertex adjacent to xx and to every neighbor of xx. Expansion conjecture. If GG is a critically ss-chromatic graph, then there exists a subset WW of the vertices such that G[W]G[W] is critically (s+1)(s+1)-chromatic. This graph-theoretic conjecture was intended to yield the persistence property for cover ideals of graphs. It was disproved by Kaiser, Stehlík and Škrekovski, who exhibited a family of counterexamples; the paper studies these counterexamples further in relation to persistence and non-increasing depth.

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.