A135515 Number of inequivalent drawings of the complete graph Kn on n vertices that attain the corresponding rectilinear crossing number (A014540).

1, 1, 1, 3, 2, 10, 2, 374

Offset: 4

Author

Don Pedro Esq. (info(AT)servierlaboratories.org), Feb 09 2008

Keywords

• nonn
• hard
• more

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]