Maximality conjecture for the graph families XHkXH^k and YHkYH^k

For each integer k1k\geq 1, let XHkXH^k and YHkYH^k denote the graph families constructed in the paper. Maximality conjecture for XHkXH^k and YHkYH^k. The graphs XHkXH^k and YHkYH^k are maximal 1-planar graphs for all k1k\geq 1. The paper proves this only for k=1k=1, so the assertion for general kk 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

No solutions have been posted yet.