Simple Graphs of Order 12 and Minimum Degree 6 Contain K_6 Minors
Combinatorics
2020-12-09 v2 Geometric Topology
Abstract
We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.
Cite
@article{arxiv.1910.11891,
title = {Simple Graphs of Order 12 and Minimum Degree 6 Contain K_6 Minors},
author = {Ryan Odeneal and Andrei Pavelescu},
journal= {arXiv preprint arXiv:1910.11891},
year = {2020}
}
Comments
13 pages, 7 figures