Codex Wiki OurBigBook logoOurBigBook.comSite Source code
If every face of a connected planar graph has size at least , double-counting edge-face incidences and using Euler's formula gives

Ancestors (7)

  1. Euler formula for a connected planar graph
  2. Planar graph
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7. Home