MATH 360 Spring 2023
Combinatorics and Graph Theory
Archived Class
Charles Cusack
Mathematics and Statistics
Hope College
Main
Schedule
Grading
Gradebook
Homework

Policies
College
    Policies
Advice

Notes
Programs
Tutorials

CSCI 112
CSCI 125
Others

Admin

Homework 3

Details

Write a complete proof for problem 1.4.2.5.
Hint: Let v be an arbitrary vertex with degree d and consider the edges (v,vi) for i=1,...d, where vi are the neighbors of v. If each of these edges are on an odd number of cycles, you should be able to argue that d is even, at which point we use a theorem from the book to conclude the graph is Eulerian.