Crossing-Free Subgraphs
North-Holland mathematics studiesPublished 1 January 1982
Miklós Ajtai, Vašek Chvátal, Monty Newborn, Endre Szemerédi
Citations280
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
If m⩾4 then every planar drawing of a graph with n vertices and m edges contains more than m3/100n2 edge-crossings and fewer than 1013n crossing-free subgraphs. The first result settles a conjecture of Erdös and Guy and the second result settles a conjecture of Newborn and Moser.
Keywords
Computer ScienceSocial Sciences
Journal of Combinatorial Theory Series BOptimal crossing-free Hamiltonian circuit drawings of Kn
28 Citations1980Monroe Newborn, W. O. J. Moser