Trees are bipartite
Builds on TreeBipartite graph
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.
Reading path
To understand this page from the ground up, read these 11 pages in order. The foundations come first.
Show the path as a graph
- 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
Further reading
About this page
| Tag | 0BN2A6EBYA |
|---|---|
| URI | m2://0BN2A6EBYA |
| Kind | statement, proposition |
| Writing | W0 stub |
| MSC | 05C05 |
| Status | This copy of the site has no build data. Run m2 status 0BN2A6EBYA. |
| Uses | Tree, Bipartite graph |
Markdown · JSON · Edit on GitHub
What this page 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 page is. They do not measure its truth.
What links here
No page links to this page yet.