Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $G$ be a graph, and minimum degree $\delta(G)\geq k$, does $G$ contain a $k$-regular subgraph?

share|cite|improve this question
up vote 4 down vote accepted

Pick a square with the diagonals, as a graph on FIVE vertices, where the vertices are the four corners and the intersection of the diagonals.

Drawing of graph

Then $\delta(G)\geq 3$ but it is trivial to see that $G$ contains no $3$-regular subgraph.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.