Post a New Question


posted by on .

Suppose G is a connected, simple, planar graph with 100 vertices. What is the largest possible number of edges in G?

  • math - ,

    Euler's formula: e ≤ 3v − 6 if v ≥ 3

    Thus, for v=100, e ≤ 294

Answer This Question

First Name:
School Subject:

Related Questions

More Related Questions

Post a New Question