Live data from Hacker News

New proof reveals that graphs with no pentagons are fundamentally different

quantamagazine.org

91–100 of 116 posts

Re: New proof reveals that graphs with no pentagons are fundamentally different

#91

Earlier quoted context omitted.

The use of "the" isn't the weird part. The weird part is that the article attempts to draw a contrast between "pentagons" and "five-sided polygons", which are exactly the same thing.

Pentagons are 5-sided polygons where all the sides are equal. Not all 5-sided polygons are pentagons. What am I missing?

You are missing the definition of a pentagon; try to avoid just making up definitions for words you don't know.

Re: New proof reveals that graphs with no pentagons are fundamentally different

#92

Earlier quoted context omitted.

Pentagons are 5-sided polygons where all the sides are equal. Not all 5-sided polygons are pentagons. What am I missing?

What you're describing is called a regular pentagon.

No, it isn't; a regular pentagon has all equal side lengths (as described) and all equal interior angles (not as described).

Re: New proof reveals that graphs with no pentagons are fundamentally different

#93

>... if the room has at least six people, you can say something about them with absolute mathematical certainty... [that it contains] either a group of three who all know each other, or a group of three who have never met. Maybe I'm incredibly dense, but this seems tautologically true, and not worth mentioning. Could somebody kindly explain what I'm missing?

The 'who have never met' isn't the opposite of 'all know each other', it's no two people of these three know each other. The opposite would be don't all know each other. If you imagine a six vertices arranged around a point and make any number of edges connecting them to represent knows each other. For any choice of edges, you can either find 3 vertices that are fully connected or you can find three vertices that hav…

Thanks, that clarifies it!

Re: New proof reveals that graphs with no pentagons are fundamentally different

#94
post #82

>... if the room has at least six people, you can say something about them with absolute mathematical certainty... [that it contains] either a group of three who all know each other, or a group of three who have never met. Maybe I'm incredibly dense, but this seems tautologically true, and not worth mentioning. Could somebody kindly explain what I'm missing?

Maybe you're not dense, maybe you're just such a genius that pigeonhole principle proofs seem naturally obvious and tautologically true to you? :-) I found this enlightening (particularly "Sketch of a Proof"), though I also admit that it seemed fairly straightforward, with elegance borne of simplicity rather than of brilliance or cleverness: https://en.m.wikipedia.org/wiki/Theorem_on_friends_and_stran...

I keep insisting so despite mounting evidence to the contrary!

Thank you for the link, this is a very good explanation.

Re: New proof reveals that graphs with no pentagons are fundamentally different

#95
post #81

>... if the room has at least six people, you can say something about them with absolute mathematical certainty... [that it contains] either a group of three who all know each other, or a group of three who have never met. Maybe I'm incredibly dense, but this seems tautologically true, and not worth mentioning. Could somebody kindly explain what I'm missing?

One could know the Two, Two know Three but Three not know One. That's neither all knowing each other nor them not meeting.

What he's saying is that there is at least one set where they all know each other or they all don't know each other, not that any set of three will be that way.

Re: New proof reveals that graphs with no pentagons are fundamentally different

#97

Earlier quoted context omitted.

Big reason is that many high school math teachers don't really understand math well enough for the job.

To clarify, since I can't edit: This is coming from my experience as someone who has taught math to teachers getting their master's degree. It sounds mean but I wanted to emphasize that the state of early math education is not just due to poorly designed curriculum, but because there is little incentive for mathematically competent people to teach children. (Imo, of course).

The other problem in my experience (as a parent and math nerd) is that the whole math teaching area is full of people who don't know math, so coming in and having a math person teach math means you have a huge number of arguments you'd have to have.

The only way I know of is to just get after school tuition and ignore the school. This is difficult though - why do I have to do maths after school? no one else does.

Re: New proof reveals that graphs with no pentagons are fundamentally different

#98

>... if the room has at least six people, you can say something about them with absolute mathematical certainty... [that it contains] either a group of three who all know each other, or a group of three who have never met. Maybe I'm incredibly dense, but this seems tautologically true, and not worth mentioning. Could somebody kindly explain what I'm missing?

To a robot, all mathematical truths are tautologies, right?

Perhaps you could imagine reading that statement with both occurrences of "three" replaced with blanks. Do you think you could confidently fill them in without more than a moment's thought?

Re: New proof reveals that graphs with no pentagons are fundamentally different

#99

>... if the room has at least six people, you can say something about them with absolute mathematical certainty... [that it contains] either a group of three who all know each other, or a group of three who have never met. Maybe I'm incredibly dense, but this seems tautologically true, and not worth mentioning. Could somebody kindly explain what I'm missing?

I can’t get in your head to know what you’re thinking so maybe it is obvious to you, but just in case you don’t fully understand: it may not be obvious that its impossible to have a configuration where in the 20 possible groups of 3, someone always knows someone else but not everyone knows everyone?

The theorem isn’t really saying “it’s A or not A”. It’s saying: “it has to be A or B and not anything else”.

Re: New proof reveals that graphs with no pentagons are fundamentally different

#100
post #86

Earlier quoted context omitted.

The 'who have never met' isn't the opposite of 'all know each other', it's no two people of these three know each other. The opposite would be don't all know each other. If you imagine a six vertices arranged around a point and make any number of edges connecting them to represent knows each other. For any choice of edges, you can either find 3 vertices that are fully connected or you can find three vertices that hav…

I would describe it as follows, maybe a little easier to visualize. Draw six dots, draw either a red or a blue line from every dot to every other dot. You must draw either a completely red triangle or a completely blue triangle. Personally I don't think it sounds intuitive when stated like that!

Thanks, personally I found this the easiest way to think about it!
Post reply on HN