Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A135515
Number of inequivalent drawings of the complete graph Kn on n vertices that attain the corresponding rectilinear crossing number (A014540).
0
1, 1, 1, 3, 2, 10, 2, 374
OFFSET
4,4
COMMENTS
Some lower bounds: a(13) >= 272, a(14) >= 2, a(15) >= 360, a(16) >= 7, a(17) >= 7532, a(18) >= 2, a(19) >= 069 and a(20) >= 4.
LINKS
O. Aichholzer, F. Aurenhammer and H. Krasser, On the crossing number of complete graphs, Computing, 76:165-176, 2006. [alternative link]
CROSSREFS
Sequence in context: A092502 A292923 A354191 * A114486 A176743 A220466
KEYWORD
nonn,hard,more
AUTHOR
Don Pedro Esq. (info(AT)servierlaboratories.org), Feb 09 2008
STATUS
approved