21484: Graph Theory

Homework 2
Submit answers to 5 of the following questions. Provide proofs/justification for your answers.

1. Recall the four equivalents definitions for a graph to be a tree. Choose any pair of state-
ments and prove their equivalence.

2. How many spanning trees of Kn have maximum degree at most d?

3. Use the matrix-tree theorem to determine the number of spanning trees of the complete
bipartite graph Kn,n .

4. How many non-isomorphic spanning trees does K2,n have? How about K3,n ?

5. Prove or disprove that a graph is bipartite if and only if no two adjacent vertices have the
same distance from any other vertex.

6. Find a function f : N → N such that for all k ∈ N every graph of average degree at least
f (k) has a bipartite subgraph of minimum degree at least k.

7. Prove or disprove that every connected graph contains a walk that traverses each of its
edges exactly once in each direction.

2. Summing up all trees of max degree <= d

3.