A short proof of the non-biplanarity of K₉

DOI10.7155/JGAA.00582zbMATH Open1489.05026arXiv2008.05186OpenAlexW4214908152MaRDI QIDQ5084705FDOQ5084705

Authors: Ahmad Biniaz 

Publication date: 28 June 2022

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/2008.05186

Recommendations

• A short proof of the non-biplanarity of \(K_9\)
• scientific article; zbMATH DE number 3987296
• A short proof of the uniqueness of Kühnel's 9-vertex complex projective plane
• On Kühnel's 9-vertex complex projective plane
• Linear embeddings of \(K_{9}\) are triple linked
• Poncelet's theorem in the four non-isomorphic finite projective planes of order 9.
• scientific article; zbMATH DE number 3774420
• Publication:3488796
• scientific article; zbMATH DE number 4029591
• Another direct proof of Oka's theorem (Oka IX)

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Über eine Eigenschaft der ebenen Komplexe
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Non-Biplanar Character of the Complete 9-Graph
• Every planar graph with nine points has a nonplanar complement
• A tribute to Frank Harary (in honor of his 70th birthday)
• Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method

Cited In (2)

• A short proof of the uniqueness of Kühnel's 9-vertex complex projective plane
• Title not available (Why is that?)

This page was built for publication: A short proof of the non-biplanarity of $K_9$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084705)