We prove that every simple graph of order 12 which has minimum degree 6 contains
a
minor, thus proving Jørgensen’s conjecture for graphs of order 12.
In the process, we establish several lemmata linking the existence of
minors for graphs to their size or degree sequence, by means of their clique sum
structure. We also establish an upper bound for the order of graphs where the
6-connected condition is necessary for Jørgensen’s conjecture.
PDF Access Denied
We have not been able to recognize your IP address
216.73.216.192
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.