- #1

SpatialVacancy

- 24

- 0

**Help me with a proof!**

Suppose that [tex]G[/tex] is a graph with [tex]v[/tex] vertices and [tex]e[/tex] edges and that the degree of each vertex is at least [tex]d_{min}[/tex] and at most [tex]d_{max}[/tex]. Show that:

[tex]\dfrac{1}{2}d_{min}\ \cdot\ v \ \leq \ e \ \leq \ \dfrac{1}{2}d_{max}\ \cdot\ v [/tex]

I don't have an idea of where to start on this problem. Thank you for your help!

Last edited: