#Pigeonhole principle and graph theory high school question

8 messages · Page 1 of 1 (latest)

solemn sedge
#

<@&286206848099549185>

slim sinewBOT
# solemn sedge <@&286206848099549185>

Please only use the <@&286206848099549185> ping once if your question has not been answered for 15 minutes. Please do not ping or DM individual users about your question.

solemn sedge
#

my bad

finite lichen
#

for a proof, you can write out the main idea of what you're thinking

#

you can write your idea in words too

brittle bluff
#

Why would you say this needs pigeonhole principle?

#

well a proof for why a loop forms is easier than the rest of the parts

#

consider a path that starts at P1. then it must go to some point P2, then it must go to P3 and on and on till Pn. Since a k doodle has a finite number of points, that Pn has to end up being a prior point. We can't just infinitely keep having more points