statement proposition
Trees are bipartite
Statement
Let be a tree. Then is bipartite.
Remarks
Proof: fix a vertex . Put a vertex in if its distance to is even, and in if it is odd. The ends of an edge have distances that differ by . It also follows from the theorem that a graph is bipartite iff it has no odd cycle, because a tree has no cycle at all.
Explanations
L1 human
Colour the vertices of a tree by levels, from a chosen root: even levels white, odd levels black. Each edge goes between neighbouring levels, so it joins a white vertex and a black vertex.
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 11 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Bipartite graph definition
- Graph definition
- Walk definition
- Reachability definition
- Trail definition
- Connected graph definition
- Circuit definition
- Cycle definition
- Acyclic graph definition
- Tree definition
- Trees are bipartite statement
Sources
What links here
No node links to this node yet.