Combinatorics Graph theory: basic notions Concept
Girth
Summary
The girth of a graph is the length of its shortest cycle, and it is infinite for a graph without cycles. Large girth means that the graph looks like a tree near each vertex. Graphs with both large girth and large chromatic number exist, a classical result of the probabilistic method. The node girth gives the precise definition.
Further reading
About this page
| Tag | D13K9GJT0B |
|---|---|
| URI | m2://D13K9GJT0B |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05C38 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.