Bickle–White conjecture on attaining the genus-sum lower bound
Bickle–White conjecture on attaining the genus-sum lower bound
From papers
Let be a graph of order , let be its complement, and let denote the genus of . For , consider the lower bound
for . Bickle–White conjecture. For every , there is a graph for which
Bickle and White established the lower bound and showed that it is attained for orders and ; Sun later showed attainment for . The conjecture asks for attainment at every order .
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
Allan Bickle and Russell Campbell, “Planar-Toroidal Decomposition of K_12”, arXiv:2507.17084 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.