5 ms·
You misread. It's either 3 people who know each other or 3 who have never met. Otherwise it's trivial with a 6-cycle.
by joshuamorton 6y ago
You misread. It's either 3 people who know each other or 3 who have never met. Otherwise it's trivial with a 6-cycle.
- nickthemagicman 6y ago3 people who know each other = T 3 people who don't know each other = F T || F = T Isn't that just True by default? Maybe I'm missing the context.
- _jal 6y agoLet me restate. 9 of the 6 people know each other = T 22 of the 6 people don't know each other = F T || F = T
- wongarsu 6y agoIf I know Dan but not Dave, then Dan, Dave and I are not 3 people who know each other, but we are not 3 people who don't know each other either.
- nickthemagicman 6y agoThank you for the clarification I was missing out on that part of it.
- alex_smart 6y agoWhy even bother adding an edge?
- verst 6y agoRight, even trivial with a 6 vertex path. Or a 6 single vertex forest
- joshuamorton 6y agoHonest answer: because I could think of the term for cycle more quickly than path.
- alex_smart 6y agoI meant, why bother adding any edge? Just use the empty graph with 6 vertices.