Maximal graph that does not contain Hamiltonian cycle

Question

My lecture notes in Graph Theory states that a graph of order $n$ and with size (= number of edges) $\binom n 2-(n-2)$ is the maximal graph that does not contain a Hamiltonian cycle.

My question now is how to find such a graph? How can I construct a graph of order $n$ such that this is true?

For the proof that no greater size can be achieved there was a similar question on this site: Proving that a graph of a certain size is Hamiltonian

This can be used to prove that no greater size can be achieved, so I am not interested in this part, only in the constructon part.

score 2 · Accepted Answer · answered Nov 09 '13 at 15:42

2

Hint: If a vertex has degree 1, it can't be part of a cycle.

answered Nov 09 '13 at 15:42

Calvin Lin

77,541

Thanks, I did not think of that, this explains the term $\binom n 2$, where does $n-2$ come from? – Ulrich Otto Nov 09 '13 at 15:45
@UlrichOtto What is the degree of a vertex in a complete graph with $n$ vertices? – Calvin Lin Nov 09 '13 at 15:46
Degree is $n-1$ – Ulrich Otto Nov 09 '13 at 15:47
Oh ok, I have to exclude this case because complete graph contains Hamiltonian cycle, but there is still n-2 instead of n-1 – Ulrich Otto Nov 09 '13 at 15:49
@UlrichOtto Read my hint ... What is $(n-1) - 1$? – Calvin Lin Nov 09 '13 at 15:50

Maximal graph that does not contain Hamiltonian cycle

1 Answers1