Facts
Citation
URLhttps://en.wikipedia.org/wiki/Kotzig%27s_theorem
Sources
Kotzig's theorem, Wikipedia
Lead sectionQuote, Lead section
In graph theory and polyhedral combinatorics, areas of mathematics, Kotzig's theorem is the statement that every polyhedral graph has an edge whose two endpoints have total degree at most 13.
Claims Backed By This Source (7 claims)
This source backs 7 claims across the atlas. As facts: 3 well-attested. As cited relationships: 2 holds. Plus 2 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Theorems, 6 claims: 2 well-attested, 2 holds, 2 general references.
- Sources, 1 claims: 1 well-attested.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.