Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On the Crossing Number of Complete Graphs O. Aichholzer , Graz, and F. Aurenhammer, Graz,
 

Summary: On the Crossing Number of Complete Graphs
O. Aichholzer  , Graz, and F. Aurenhammer, Graz,
and H. Krasser y , Graz
June 3, 2005
Abstract
Let cr(G) denote the rectilinear crossing number of a graph G. We
determine cr(K 11 ) = 102 and cr(K 12 ) = 153. Despite the remark-
able hunt for crossing numbers of the complete graph K n { initiated
by R. Guy in the 1960s { these quantities have been unknown for
n > 10 to date. Our solution mainly relies on a tailor-made method
for enumerating all inequivalent sets of points (order types) of size 11.
Based on these ndings, we establish a new upper bound on cr(K n )
for general n. The bound stems from a novel construction of drawings
of K n with few crossings.
AMS Subject Classi cation: 65D18, 05C62, 05A99
Key words: crossing number, complete graph, order types, enumeration
1 Introduction
The crossing number of a graph G is the least number of edge crossings at-
tained by a drawing of G in the plane. Drawing may be interpreted in several
ways leading to di erent concepts of crossing number; Pach and Toth [19]

  

Source: Aurenhammer, Franz - Institute for Theoretical Computer Science, Technische Universitšt Graz
Technische Universitšt Graz, Institute for Software Technology

 

Collections: Computer Technologies and Information Sciences