Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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 simple digraph with $16$ vertices. Suppose that any $10$ vertices of $G$ form a cycle of length $10$. Prove that any $11$ vertices of $G$ also form a cycle of length $11$.

Is this a special case from a general result?

share|cite|improve this question

Your Answer


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

Browse other questions tagged or ask your own question.