Gamma-zero characterization conjecture for k-connected graph symmetric edge polytopes
Statement
For , let be the graph obtained from by adding all edges among the vertices in the first part; equivalently, it is the -fold cone over isolated vertices. Let be the symmetric edge polytope of a graph on vertices, and let denote its th gamma coefficient. A graph is -connected if deleting fewer than vertices leaves it connected.
Gamma-zero characterization conjecture. If and is a -connected graph on vertices, then
if and only if , or and
The conjecture generalizes the stated characterization for and has been verified computationally for small values of and . Its general status remains open.
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.