News for hackers. Stuff that matters.

A comment on Rainbow Proof Shows Graphs Have Uniform Parts. Parent comment

Re:Rainbow Proof Shows Graphs Have Uniform Parts by danbruc on Friday February 21, 2020 @07:11AM (#22382534)
The edges of complete graphs with 2n + 1 vertices can be covered with the edges of 2n + 1 identical copies of any tree with n + 1 vertices.
[ Parent | on HN ]

There are no comments on this comment yet.