Can you find a simple graph with n vertices with n ::: 3
Chapter 9, Problem 9.5.48(choose chapter or problem)
Can you find a simple graph with n vertices with n ::: 3 that does not have a Hamilton circuit, yet the degree of every vertex in the graph is at least (n - 1 )/2?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer