The staircase representation conjecture for Cheeger graphs
The staircase representation conjecture for Cheeger graphs
Let be the indicated two-vertex graph, let denote disjoint union, and let a staircase graph mean a graph of the staircase type defined in the paper. Staircase representation conjecture. Every Cheeger graph other than
can be represented as a staircase graph. This daring conjecture would imply both the triangle-freeness and bipartiteness conjectures for Cheeger graphs. It is presented as an open problem.
Sources & referencesView supporting material
Primary source
D. N. Kozlov, “The first Cheeger constant of a simplex”, arXiv:1610.07136 (2017).
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
Sign in to submit a solution.
No solutions have been posted yet.