Francisco–Hà–Van Tuyl's expansion conjecture for critically chromatic graphs
Statement
Let be a graph that is critically -chromatic, meaning that its chromatic number is and deleting any vertex lowers the chromatic number. For a subset of the vertices of , let denote the graph obtained by expanding every vertex of into two adjacent vertices, each inheriting all the original neighbors. Francisco–Hà–Van Tuyl's expansion conjecture. There exists a subset of the vertices of such that is critically -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.