Theoremcore
Odd cycle characterization of bipartite graphs
A graph is bipartite if and only if it contains no cycle of odd length.
A graph is bipartite if and only if it contains no cycle of odd length.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag R12XWJ Edit this page History Report an error