Maximality conjecture for the graph families and
Maximality conjecture for the graph families and
For each integer , let and denote the graph families constructed in the paper. Maximality conjecture for and . The graphs and are maximal 1-planar graphs for all . The paper proves this only for , so the assertion for general remains open.
Sources & referencesView supporting material
Primary source
Zhangdong Ouyang, Yuanqiu Huang, Licheng Zhang and Fengming Dong, “The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity”, arXiv:2504.21558 (2025).
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.