Francisco–Hà–Van Tuyl's expansion conjecture for critically chromatic graphs

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.

Sources & referencesView supporting material

Primary source

Christopher A. Francisco, Huy Tai Ha and Jeffrey Mermin, “Powers of squarefree monomial ideals and combinatorics”, arXiv:1303.6642 (2013).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.