AMR-030-0016
Open
L3
Define the "crossing number" of a graph to be the minimum number of (topological) crossings of edges in any straight-lin
Category:Combinatorics
Set:AMR Open Problem Lists
Pach, Tóth
Problem Statement
Background
UnsolvedMath v1.3 research audit
Research Notes
Open — literature triaged
Suggested difficulty: L3
Source wording reviewed
These notes are machine-generated research aids from a supervised audit, not peer-reviewed mathematical results. Verify citations and arguments before relying on them.
Audit summary
Result
What remains
Full audit trail
Problem and source review
Literature status
Work performed
About Combinatorics: Counting problems, graph theory, discrete structures.
Discussion (0)
No comments yet. Be the first to discuss this problem!
Sign in to start the conversation.
Checking sign-in status...