A short proof of the non-biplanarity of K₉
From MaRDI portal
Publication:5084705
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.
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)
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3087498 (Why is no real title available?)
- 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
- Every planar graph with nine points has a nonplanar complement
- The Non-Biplanar Character of the Complete 9-Graph
- Über eine Eigenschaft der ebenen Komplexe
Cited in
(2)
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)
