# Issue UPDATE: in graph theory, different definitions of edge crossing numbers - impact on applications?

QUICK FINAL UPDATE: Just wanted to thank you MO users for all your support. Special thanks for the fast answers, I've accepted first one, appreciated the clarity it gave me. I've updated my torus algorithm with $${\rm cr}(G)$$. Works fine on my full test set, i.e. evidence for $${\rm cr}(G)={\rm pcr}(G)$$ on torus. More on this later, will test sharper bound from last answer as well. I'm going to submit in time! Thanks again MO users for all your help!

Original post:
I apologize if „crisis“ is too strong a word, but I am in a mode of panic, if that's the right word: In two weeks, I should be submitting my Ph.D. Thesis, but I have just received bad news, or I should say information that makes me very concerned. It is really an emergency situation:

My thesis is in computer science, algorithms related to graph drawings on the sphere and the torus. One of the cornerstone mathematical results I am relying on is the graph edge crossing lemma (or edge crossing inequality). It gives a lower bound for the minimum number of edge crossings $${\rm cr}(G)$$ for any drawing of the graph $$G$$ with $$n$$ vertices and $$e$$ edges $${\rm cr}(G)\geq \frac{e^3}{64n^2}$$ for $$e>4n$$.

PROBLEM: I am reading in the article of Pach and Tóth that there is a possibility that mathematics papers on crossing numbers operate with different definitions. There is the crossing number $${\rm cr}(G)$$ (minimum of edge crossings in a drawing of $$G$$), but also the pair crossing number $${\rm pcr}(G)$$, the minimum number of edge pairs crossing in a drawing of $$G$$. I double-checked my algorithms and, based on this definition, I clearly apply the pair crossing number $${\rm pcr}(G)$$

CRITICAL QUESTION: Can you confirm to me that the edge crossing lemma remains valid on the sphere and the torus also for the pair crossing number $${\rm pcr}(G)$$?

Reference: János Pach and Géza Tóth. Which crossing number is it anyway? J. Combin. Theory Ser. B, 80(2): 225–246, 2000.

And Wikipedia article as a starting point https://en.wikipedia.org/wiki/Crossing_number_inequality

• I don't really know anything about crossing numbers, but I can appreciate how stressful this must be for you. I hope that you are able to patch things up in time! – Carl-Fredrik Nyberg Brodda Jul 28 at 8:24
• @PerAlexandersson --- as I understand it two edges may intersect multiple times; this multiplicity is counted in cr but not in pcr, hence pcr $\leq$ cr. – Carlo Beenakker Jul 28 at 15:53
• I suppose that the downvoter never felt any stress while doing his/her Ph.D Thesis... – EFinat-S Jul 28 at 17:15
• Frege once had to write "A scientist can hardly meet with anything more undesirable than to have the foundations give way just as the work is finished. I was put in this position by a letter from Mr. Bertrand Russell when the work was nearly through the press. "... – Toffomat Jul 29 at 8:49
• Maybe you could accept the answer that is here, and then add your own answer after you successfully defend your dissertation. The vast majority of people who read this question are rooting for you. – John Coleman Jul 29 at 13:34

$$\DeclareMathOperator\cr{cr}\DeclareMathOperator\pcr{pcr}$$For the pair crossing number $$\pcr(G)$$, the short answer is yes the crossing lemma holds for drawings on the sphere, but it is not known whether it also holds on the torus.

The best and most current reference for you could be the survey article from Schaefer, updated in February 2020: “The Graph Crossing Number and its Variants: A Survey” from the Electronic Journal of Combinatorics (https://doi.org/10.37236/2713).

The relevant pages for you are pages 5 and 6 with the following quote from Schaefer:

“Since the Hanani–Tutte theorem is not known to be true for the torus, this means that we do not currently have a proof of the crossing lemma for $$\pcr$$ or $$\pcr_−$$ on the torus.”

Generally, $$\pcr(G)\leq \cr(G)$$. It is still an open problem whether they are equal or not. The first proofs of the crossing lemma did not make the distinction. The first one to raise the ambiguity was Mohar (1995) in a conference talk.

The Pach and Tóth (2000) paper that you mention does make the distinction between $$\pcr(G)$$ and $$\cr(G)$$, and applies Hanani–Tutte in the proof of the crossing lemma, which ensures that it also holds for $$\pcr(G)$$.

The issue is that you can apply Hanani–Tutte for the sphere (and the projective plane), but you cannot apply it for the torus. For surfaces of genus $$\geq4$$ it is known to be false, see Fulek and Kynčl (2019). This means the torus is really “in-between”.

Bojan Mohar (1995): Problem mentioned at the special session on Topological Graph Theory, Mathfest, Burlington, Vermont. (cited from: L.A. Székely (2016): Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill. In: R. Gera et al. (eds.)(2016): Graph Theory—favorite conjectures and open problems. 1.)

Hanani–Tutte Theorem https://en.wikipedia.org/wiki/Hanani%E2%80%93Tutte_theorem

Radoslav Fulek and Jan Kynčl (2019): Counterexample to an Extension of the Hanani–Tutte Theorem on the Surface of Genus 4. Combinatorica, 39(6):1267–1279

• The author's name is Toth by the way, not Thot lol. – Hollis Williams Jul 28 at 23:26
• From OP's point of view this could be viewed as glass half-full rather than glass half-empty. Their dissertation results hold unequivocally on the sphere and might hold on the torus, though it is an open problem if they do. It is certainly legitimate to study what follows from a given conjecture being true. It could even be spun as a feature rather than a bug of the dissertation. If the results in fact fail on the torus then you know that the conjecture must be false. Potentially, it could open up a fruitful avenue of attack. – John Coleman Jul 29 at 0:25
• I think in algebraic topology literature, Hanani-Tutte is known as a version of the Flores-Van Kampen theorem, if that's a helpful link – Matt Jul 29 at 8:53
• Adding to my comment, here is a 2019 reference "Invariants of graph drawings in the plane" from A. Skopenkov arxiv.org/pdf/1805.10237.pdf – Matt Jul 29 at 9:05
• @ClausDollinger . The clarity is helpful. Thanks for your fast help. Much appreciated. I'm glad I can keep my sphere algorithm. I'm checking whether I can adapt my torus algorithm to ${\rm cr}(G)$ within the next 5 days – user161819 Jul 29 at 17:22

Assuming an unpublished Ramsey-type result by Robertson and Seymour about Kuratowski minors [FK18, Claim 5], which is now "folklore" in the graph-minor community, an asymptotic variant of the crossing lemma, $$\operatorname{cr}(G)\ge \Omega(e^3/n^2)$$, is true even for the pair crossing number on a fixed surface, such as a torus.

With Radoslav Fulek [FK18, Corollary 9] we have shown that [FK18, Claim 5] implies an approximate version of the Hanani–Tutte theorem on orientable surfaces. In particular, [FK18, Claim 5] implies that there is a constant $$g$$ such that for every graph $$G$$ that can be drawn on the torus with every pair of independent edges crossing an even number of times, $$G$$ can be drawn on the orientable surface of genus $$g$$ without crossings. This gives an upper bound $$3n + O(g)$$ on the number of edges of every such graph $$G$$, and this can be used in the probabilistic proof of the crossing lemma, as described on p. 5-6 of Marcus Schaefer's survey [S20], mentioned in Claus Dollinger's answer. See also [SSSV96, Theorem 4.1].

References:

[FK18] https://dx.doi.org/10.4230/LIPIcs.SoCG.2018.40, https://arxiv.org/abs/1803.05085 - R. Fulek and J Kynčl, The $$\mathbb Z_2$$-genus of Kuratowski minors

[SSSV96] https://doi.org/10.1007/BF02086611 - F. Shahrokhi, L. A. Székely, O. Sýkora and I. Vrt'o, Drawings of graphs on surfaces with few crossings, Algorithmica 16, 118-131 (1996)

[S20] https://doi.org/10.37236/2713 - M. Schaefer, The Graph Crossing Number and its Variants: A Survey, The Electronic Journal of Combinatorics, DS21: Feb 14, 2020.

• Is Schaefer's survey Hanani–Tutte and related results (MSN)? – LSpice Jul 29 at 16:30
• I meant the survey about crossing numbers, mentioned in Claus Dollinger's answer. I will make an edit and add the reference to make it clear. – Jan Kyncl Jul 29 at 16:47
• By the way, you know that diacrits like ˇ are allowed in your username if you want, right? – LSpice Jul 29 at 17:03
• @JanKyncl Thank you for your help as well, much appreciated. My advisor says the faculty will not accept asymptotics. I'm checking whether I can put ${\rm cr}(G)$ into my torus algorithm – user161819 Jul 29 at 17:26
• "the faculty will not accept asymptotics"? – Ville Salo Jul 29 at 20:39

@user161819 I wanted to make a comment but it got too long, so putting it as an answer. But please take it just as a comment for later, once everything is finished:

If I understand your comment to my answer correctly, you are aiming to change your algorithm for the torus so it works with $${\rm cr}(G)$$. I think the whole MO community is keeping their fingers crossed, wishing you that you can successfully complete everything in time!

Looking at the far horizon, I wanted to make a suggestion to you. Once you have changed your torus algorithm and completed your thesis, you will have effectively two algorithms in your hands for the torus: The old one based on $${\rm pcr}(G)$$ and the new one based on $${\rm cr}(G)$$. I am saying the obvious here, keep both of them, they can really be fruitful for future research.

(1) Obviously, your two algorithms could support research on the big open question whether $${\rm pcr}(G)\stackrel{\rm ?}{=}{\rm cr}(G)$$ or not. They could produce experimental evidence, ideas, and insights for a future proof of equality, or an actual counterexample. (Again, I am saying the obvious here.)

(2) To really pressure-test $${\rm pcr}(G)\stackrel{\rm ?}{=}{\rm cr}(G)$$ on the torus, it would be interesting to also try the best known to date lower bound for $${\rm cr}(G)$$ $$\frac{1}{29}\frac{e^3}{n^2}$$ for graphs with $$e>7n$$. This lower bound is from Eyal Ackerman (2019): "On topological graphs with at most four crossings per edge", Computational Geometry, 85: 101574, 31, doi:10.1016/j.comgeo.2019.101574 (probably you are aware of it from the Wikipedia article that you quoted).

I think your question and this whole topic are really important. László Székely calls it one of the "foundational problems" and devotes a whole section to it in his article Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill. In: R. Gera et al. (eds.)(2016): Graph Theory—favorite conjectures and open problems. 1.)

For now, fingers crossed that you can complete your thesis in time!

• Thanks for your comment!! Much appreciated. And thanks again for your help. I'm very interested in this Ackermann bound, will take a look at it – user161819 Jul 30 at 16:28
• One good thing, my prototype for updated torus algorithm: tested on on first 2 graphs from my test set, and went ok – user161819 Jul 30 at 16:33
• The term "Ackermann bound" generally refers to a bound of a type far, far worse than the one given here: en.wikipedia.org/wiki/Ackermann_function – Terry Tao yesterday
• @TerryTao Terry you are very right. Huge difference between the Wilhelm Ackermann bound that you mention and the Eyal Ackerman bound I am quoting here! Good to make the distinction. – Claus Dollinger yesterday