# Euler’s polyhedron theorem

###### Theorem 1

If a connected plane graph^{} has $n$ vertices, $m$ edges, and $f$ faces, then

$$n-m+f=2.$$ |

Title | Euler’s polyhedron theorem |
---|---|

Canonical name | EulersPolyhedronTheorem |

Date of creation | 2013-03-22 12:25:28 |

Last modified on | 2013-03-22 12:25:28 |

Owner | Mathprof (13753) |

Last modified by | Mathprof (13753) |

Numerical id | 6 |

Author | Mathprof (13753) |

Entry type | Theorem |

Classification | msc 05C99 |

Synonym | Euler’s formula |

Related topic | Graph |

Related topic | GraphTheory |

Related topic | PoincareFormula |

Related topic | Polytope |