Bickle–White conjecture on attaining the genus-sum lower bound

About 1 year old · traced to

Let GG be a graph of order nn, let G‾\overline{G} be its complement, and let γ(G)\gamma(G) denote the genus of GG. For n≥11n\geq 11, consider the lower bound

⌈112(n2−13n+24)⌉\left\lceil \frac{1}{12}\left(n^{2}-13n+24\right)\right\rceil

for γ(G)+γ(G‾)\gamma(G)+\gamma(\overline{G}). Bickle–White conjecture. For every n≥11n\geq 11, there is a graph GG for which

γ(G)+γ(G‾)=⌈112(n2−13n+24)⌉.\gamma(G)+\gamma(\overline{G})=\left\lceil \frac{1}{12}\left(n^{2}-13n+24\right)\right\rceil.

Bickle and White established the lower bound and showed that it is attained for orders n=12s+11n=12s+11 and n∈{13,25,37,49}n\in\{13,25,37,49\}; Sun later showed attainment for n=24s+13n=24s+13. The conjecture asks for attainment at every order n≥11n\geq 11.

References

Primary source

Allan Bickle and Russell Campbell, “Planar-Toroidal Decomposition of K_12”, arXiv:2507.17084 (2026).

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

No solutions have been posted yet.