The Nordhaus-Gaddum upper-bound conjecture for the Cheeger constant
The Nordhaus-Gaddum upper-bound conjecture for the Cheeger constant
Let be a graph, let be its complement, and let denote the Cheeger constant of . Write for the star graph on vertices, and let denote the join of the complete graph on three vertices and the edgeless graph on vertices.
Cheeger-constant Nordhaus-Gaddum conjecture. If , then
The conjecture is motivated by computational and structural comparisons among graph families, but the supplied text gives no resolution or status evidence beyond presenting it as a conjecture.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Mark Kempton, Xavier Zaitzeff and Sibi Muthuprakash, “Nordhaus-Gaddum upper bounds for graph connectivity parameters”, arXiv:2606.12751 (2026).
Additional references
4 papers in this index state this conjecture (2018–2026). The statement above is taken from the most recent of them; the others are arXiv:2206.03723, arXiv:1808.05576, arXiv:1807.06436.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.