Applied Combinatorics, 4th Ed. Alan Tucker

Applied Combinatorics, 4th Ed.Alan Tucker Section 1.3 Edge Counting Prepared by Joshua Schoenly and Kathleen McNamara Tucker, Sec. 1.3

Theorem 1 Statement: In any graph, the sum of the degrees of all vertices is equal to twice the number of edges. where E is the number of edges, d is the degree of any vertex, nd is the number of vertices of degree d, and v is any vertex in the graph. Tucker, Sec. 1.3

Example 1: Use of Theorem 1 Suppose we want to construct a graph with 20 edges and have all vertices of degree four. How many vertices must the graph have? It must have 10 vertices! Tucker, Sec. 1.3

Proof: Summing the degrees of all vertices counts all instances of some edge being incident to some vertex. But, each edge is incident with two vertices, and so the total number of such edge-vertex incidences is simply twice the number of edges. Tucker, Sec. 1.3

Corollary: In any graph, the number of vertices of odd degree is even. Proof of Corollary: Because twice the number of edges must be an even integer, the sum of degrees must be an even integer. For the sum of degrees to be an even integer, there must be an even number of odd integers in the sum. Tucker, Sec. 1.3

Definitions • Component- connected pieces of a graph Component 1 Component 2 Component 3 • Length- the number of edges in a path. e d Path abde has length 3. Path eabcd has length 4. b a c Tucker, Sec. 1.3

Definitions • Bipartite- a graph G is bipartite if its vertices can be partitioned into two sets, v1 and v2, such that every edge joins a vertex in v1with a vertex v2. v1 v2 Tucker, Sec. 1.3

Definitions • Complete Bipartite- a bipartite graph in which every vertex on one side is connected to every vertex on the other side. • For Example: K3,4 Tucker, Sec. 1.3

Theorem 2 Statement: A graph G is bipartite if and only if every circuit in G has an even length. L=4 Tucker, Sec. 1.3

a b f d c e Proof: Bipartite implies even length circuits a b d c e f G Tucker, Sec. 1.3

Proof (part 2): Even length circuits imply bipartite a b a b f d d c e f c e G Tucker, Sec. 1.3

M E W C V X T B Y D U Z A Example 4 • Rules: • Hikers start at points A and Z • Hikers must stay at the same altitude at all times • Stops must have at least one hiker on a peak or valley • Objective: Hikers must reach M at the same time Tucker, Sec. 1.3

M E W C V X T B Y D U Z A The hikers must be at the same altitude, so when hiker A climbs to point C, hiker Z must climb to point X. Then when hiker A descends to D, hiker Z must then descend to Y in order to be at the same altitude. (C,X) (D,Y) (A,Z) Tucker, Sec. 1.3

M E W (M,M) C V X T (E,W) B Y D (C,T) (C,V) U (C,X) Z A (D,Y) (D,U) (B,U) (A,Z) Solution to Example 4 Tucker, Sec. 1.3

Class Problem – 1.3 / 3 What is the largest possible number of vertices in a graph with 19 edges and all vertices of degree at least 3? (Hint – use Theorem 1) Tucker, Sec. 1.3

Solution to Problem • First try with only degree 3: • But 38 isn’t divisible by 3, so that doesn’t work. • Next try with all vertices having degree 3, except one with degree 4: • But 34 isn’t divisible by 3, so that doesn’t work either. • Next try with all vertices having degree 3, except two with degree 4: • That works! So the largest number of vertices is 12. Tucker, Sec. 1.3

Applied Combinatorics, 4th Ed. Alan Tucker