A short proof of the non-biplanarity of K_9

08/12/2020
by   Ahmad Biniaz, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2017

Yet Another Proof of the Aperiodicity of Robinson Tiles

Short proof of the aperiodicity of the Robinson tile set....
research
12/01/2021

A Note on the Borel-Cantelli Lemma

In this short note, we discuss the Barndorff-Nielsen lemma, which is a g...
research
12/22/2020

Towards a short proof of the Fulek–Kynčl criterion for modulo 2 embeddability of graphs to surfaces

A connected graph K has a modulo 2 embedding to the sphere with g handle...
research
06/25/2019

A note on Bianchi-Donà's proof to the variance formula of von Neumann entropy

Bianchi and Donà [1] have recently reported a proof to the variance form...
research
10/20/2020

The Elliptical Potential Lemma Revisited

This note proposes a new proof and new perspectives on the so-called Ell...
research
10/04/2017

Note on "The Complexity of Counting Surjective Homomorphisms and Compactions"

Focke, Goldberg, and Živný (arXiv 2017) prove a complexity dichotomy for...
research
10/15/2017

The Complete Extensions do not form a Complete Semilattice

In his seminal paper that inaugurated abstract argumentation, Dung prove...

Please sign up or login with your details

Forgot password? Click here to reset