arXiv:2008.05186 Abstract | arXiv Analytics

arXiv:2008.05186 [math.CO]Abstract References Reviews Resources

A short proof of the non-biplanarity of $K_9$

Published 2020-08-12Version 1

Battle, Harary, and Kodama (1962) and independently Tutte (1963) proved that the complete graph with nine vertices is not biplanar. Aiming towards simplicity and brevity, in this note we provide a short proof of this claim.

Categories: math.CO, cs.CG, cs.DM

Keywords: short proof, non-biplanarity, complete graph, independently tutte

Related articles: Most relevant | Search more

arXiv:1303.4061 [math.CO] (Published 2013-03-17)

An Erdős--Ko--Rado theorem for matchings in the complete graph

Vikram Kamat, Neeldhara Misra

arXiv:1402.2087 [math.CO] (Published 2014-02-10, updated 2014-02-20)

Connected Colourings of Complete Graphs and Hypergraphs

Imre Leader, Ta Sheng Tan

arXiv:1311.2785 [math.CO] (Published 2013-11-12, updated 2014-05-14)

On the Buratti-Horak-Rosa Conjecture about Hamiltonian Paths in Complete Graphs

Anita Pasotti, Marco Antonio Pellegrini

arXiv Analytics

arXiv:2008.05186 [math.CO]Abstract References Reviews Resources

A short proof of the non-biplanarity of $K_9$

Links

Toolbox

arXiv:2008.05186 [math.CO]AbstractReferencesReviewsResources

A short proof of the non-biplanarity of $K_9$

Links

Toolbox

arXiv:2008.05186 [math.CO]Abstract References Reviews Resources