Kotzig's theorem
id:
kotzig-s-theorem-193-4427577
title:
Kotzig's theorem
text:
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. An extreme case is the triakis icosahedron, where no edge has smaller total degree. The result is named after Anton Kotzig, who published it in 1955 in the dual form that every convex polyhedron has two adjacent faces with a total of at most 13 sides. It was named and popularized in the west in the 1970s by
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Kotzig%27s_theorem
date created:
date modified:
2023-06-21T04:05:41Z
main entity:
{"identifier":"Q85774945","url":"https://www.wikidata.org/entity/Q85774945"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/dd/Triakisicosahedron.jpg","width":819,"height":849}
fields total:
13
integrity:
14