Given $91$ vertices and $456$ edges. Prove that there exists a $4$ step cycle.
#Graph Theory?
dusky hawk
crystal mauveBOT
God of Arctic
untold cometBOT
Given $91$ vertices and $456$ edges. Prove that there exists a $4$ step cycle.
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close - Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules. If there is a conflict amongst multiple helpers feel free to ping “Helper Mod”
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
dusky hawk
**God of Arctic**
Btw can anyone, give some sort of a handout so that i could study olympiad graph theory. (Other than evan's handouts)
dusky hawk
@wraith harness
wraith harness
Please do not ping moderators or random users unsolicited, this will not make help arrive any faster.
what's a step cycle
all i can find is that the total degree is 912 so, by pigeonhole principle, there must exist one vertex with a degree of at least 11
dusky hawk
Please do not ping moderators or random users unsolicited, this will not make he...
Sorry
dusky hawk
what's a step cycle
If $a,b,c,d$ are vertices, then there exists a pathway such that
crystal mauveBOT
God of Arctic
dusky hawk
wraith harness
the edges are two-way?
dusky hawk
the edges are two-way?
An edge connects two vertices
dusky hawk
And there could be only one edge between two given vertices
dusky hawk
+close