The Nordhaus-Gaddum upper-bound conjecture for the Cheeger constant

From papers

Let GG be a graph, let GcG^c be its complement, and let h(G)h(G) denote the Cheeger constant of GG. Write SnS_n for the star graph on nn vertices, and let K3En3K_3\vee E_{n-3} denote the join of the complete graph on three vertices and the edgeless graph on n3n-3 vertices.

Cheeger-constant Nordhaus-Gaddum conjecture. If GSnG\neq S_n, then

max{h(G),h(Gc)}h(K3En3).\max\{h(G),h(G^c)\}\leq h(K_3\vee E_{n-3}).

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

No solutions have been posted yet.