ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Pach, Tóth: Define the "crossing number" of a graph to be the minimum number of (topological) crossings of edges in any straight-line embedding in the plane. Define the "pairwaise crossing number" of a graph the be the minimum number of crossing pairs of edges in any straight-line embedding in the plane. These two quantities may differ, since two edges may cross multiple times. But do they really differ? Or, on the other hand, is it true that for every graph G, its crossing number and pairwise crossing number are the same?

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.