ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph that is critically ss-chromatic, meaning that its chromatic number is ss and deleting any vertex lowers the chromatic number. For a subset WW of the vertices of GG, let G[W]G[W] denote the graph obtained by expanding every vertex of WW into two adjacent vertices, each inheriting all the original neighbors. Francisco–Hà–Van Tuyl's expansion conjecture. There exists a subset WW of the vertices of GG such that G[W]G[W] is critically (s+1)(s+1)-chromatic. This conjecture is proposed as a possible approach to proving persistence for cover ideals of imperfect graphs; the source gives affirmative persistence results for odd holes and odd antiholes but does not state a resolution of the expansion conjecture.

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.