Odd crossing number and crossing number are not the same (Q2482214): Difference between revisions

The crossing number \(\text{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings, taken over all drawing of \(G\) in the plane. Similarly \(\text{per}(G)\) (respectively \(\text{ocr}(G)\)) denotes the minimum number of pairs of edges which cross at least once (respectively an odd number of times), over all drawings of \(G\) in the plane. It is immediate that \(\text{ocr}(G)\leq\text{pcr}(G)\leq\text{cr}(G)\). \textit{J. Pach} and \textit{G. Tóth} [J. Comb. Theory, Ser. B 80, No. 2, 225--246 (2000; Zbl 1023.05042)] asked if the inequalities are actually equalities. The present authors construct a simple example of a graph (and then an infinite family of simple graphs) for which \(\text{ocr}(G)< \text{pcr}(G)\).