|
| |
|
|
A135515
|
|
Number of inequivalent drawings of the complete graph Kn on n vertices that attain the corresponding rectilinear crossing number (A014540).
|
|
0
| | |
|
|
|
OFFSET
| 4,4
|
|
|
COMMENTS
| Some lower bounds: a(12) >=, 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.
|
|
|
CROSSREFS
| Sequence in context: A049971 A156528 A092502 * A114486 A176743 A090780
Adjacent sequences: A135512 A135513 A135514 * A135516 A135517 A135518
|
|
|
KEYWORD
| hard,more,nonn
|
|
|
AUTHOR
| Don Pedro Esq. (info(AT)servierlaboratories.org), Feb 09 2008
|
| |
|
|
