The generalized Nase conjecture on triple cumulative edge bounds
Let be a simple drawing of a graph, and let denote the number of its -edges, with
Here denotes the number of -edges in the drawing. The generalized Nase conjecture. If and is a simple drawing of a graph with at least edges, then
This extends the complete-graph conjecture to arbitrary graphs. The authors report no counterexample, but provide no proof in general, so the statement remains open.
References
- Martin Balko, Radoslav Fulek and Jan Kynčl, “Crossing numbers and combinatorial characterization of monotone drawings of K_n”, arXiv:1312.3679 (2014).
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.