13 problems
- 0 votes0 replies0 views
Perfectly contractile graphs and quadratic stable-set ideals
Perfect-contractility conjecture. The following conditions are equivalent:
- 0 votes0 replies0 views
The perfect-graph characterization of quadratic stable-set toric ideals
Stable-set ideal conjecture. The following conditions are equivalent:
- 0 votes0 replies0 views
Existence conjecture for \b5-minimal graphs of the Lovsz--Schrijver operator
Given an integer , let be the smallest number of vertices of a graph with -rank . A graph is -minimal if …
- 0 votes0 replies0 views
The cycle complement stable-set polynomial conjecture
Let be the cycle graph on vertices, let denote its perfectly matchable set polynomial, and let denote the normalized -polynomial o…
- 0 votes0 replies1 view
Hibi–Tsuchiya's conjecture on the h-vector of cycle graph stable set Ehrhart rings
Let be a cycle graph with , let be its Ehrhart ring, and write its h-vector as with . S…
- 0 votes0 replies0 views
Conjectured facet count for the stable set matrix polytope on seven vertices
Let be the edgeless graph with , and let denote the number of facets of its stable set matrix pol…
- 0 votes0 replies0 views
Quadratic toric ideal conjecture for perfect graphs
Let be a perfect finite simple graph, and let denote the toric ideal associated with the stable set polytope of . Let be the class of graphs with no odd…
- 0 votes0 replies0 views
Ben Rebea's conjecture on clique-family inequalities for quasi-line graphs
Ben Rebea's conjecture. The clique-family inequalities, together with the non-negativity constraints and clique inequalities, describe the stable set polytope of every quasi-line g…
- 0 votes0 replies0 views
The -Perfect Graph Conjecture
-Perfect Graph Conjecture. The stable set polytope of every -perfect graph can be described by facet-defining inequalities with near-bipartite support.
- 0 votes0 replies1 view
The near-bipartite inequality conjecture for -perfect graphs
Let denote the Lovász–Schrijver positive semidefinite relaxation of the stable set polytope, and call -perfect when…
- 0 votes0 replies0 views
The full-support facet conjecture for -perfect graphs
Let denote the Lovász–Schrijver positive semidefinite relaxation of the stable set polytope. A graph is -perfect when…
- 0 votes0 replies0 views
Shepherd's characterization conjecture for near-perfect graphs
A graph is near-perfect if its stable set polytope is defined by non-negativity constraints, clique constraints, and the full-rank constraint , wh…
- 0 votes0 replies0 views
The near-bipartite characterization conjecture for -perfect graphs
For a graph , let be its stable set polytope, the near-bipartite polyhedral relaxation, and the Lovász…