

A014540


Rectilinear crossing number of complete graph on n nodes.


8



0, 0, 0, 0, 1, 3, 9, 19, 36, 62, 102, 153, 229, 324, 447, 603, 798, 1029, 1318, 1657, 2055, 2528, 3077, 3699, 4430, 5250, 6180
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,6


COMMENTS

The values a(19) and a(21) were obtained by Aichholzer et al. in 2006. The value a(18) is claimed by the Rectilinear Crossing Number project after months of distributed computing. This was confirmed by Abrego et al., they also found the values a(20) and a(22) to a(27). The next unknown entry, a(28), is either 7233 or 7234.  Bernardo M. Abrego (bernardo.abrego(AT)csun.edu), May 05 2008


REFERENCES

M. Gardner, Crossing Numbers. Ch. 11 in Knotted Doughnuts and Other Mathematical Entertainments. New York: W. H. Freeman, 1986.
C. Thomassen, Embeddings and minors, pp. 301349 of R. L. Graham et al., eds., Handbook of Combinatorics, MIT Press.


LINKS



CROSSREFS



KEYWORD

nonn,nice,hard,more


AUTHOR



EXTENSIONS

102 from Oswin Aichholzer (oswin.aichholzer(AT)tugraz.at), Aug 14 2001
153 from Hannes Krasser (hkrasser(AT)igi.tugraz.ac.at), Sep 17 2001
More terms from Bernardo M. Abrego (bernardo.abrego(AT)csun.edu), May 05 2008


STATUS

approved



