MA410 Tutorial Sheet - II

The following is a list of exercises selected from the text book. Attempt all of these.

(1) A k-partite graph is a graph whose vertex set can be partitioned into k subsets in such a way that no edge has both ends in the same set. Let G be a simple k-partite graph with size of partitioned sets a1 , a2 , . . . , ak . Show k 1 that m 2 ai (n ai ), where m and n denote the number of edges and
i=1

(2)

(3) (4)

(5) (6) (7)

(8)

vertices of G respectively. A k-partite graph is complete if any two vertices in dierent parts(set of vertices) are adjacent. A simple complete k-partite graph on n vertices whose parts are of equal or of size n/k is called a Turan graph denoted by Tk,n . Show that Tk,n has more edges than any other simple complete k-partite graph on n vertices. Determine the number of edges of Tk,n . Show that if G is connected and m > (n1) C 2 or min degree > 1 (n 2) 2 then G is a connected graph. Let n, m denote the number of vertices and edges of a graph G. Show that G contains a cycle if m n, what can you say about this when n > m. For each n > 0 nd an acyclic graph with m = n 1. 1 Show that every simple graph has a vertex v and a family of 2 d(v) cycles any two of which meet only in the vertex v. Show that the Petersen graph has girth 5 and circumference 9. Count the number of cycles of length l in this graph, for 5 l 9. Show the following : (a) a k-regular graph of girth 4 has at least 2k vertices. If k 2, determine all k-regular graphs of girth four on 2k vertices. (b) a k-regular graph of girth 5 has at least k 2 + 1 vertices. If k 2, determine all k-regular graphs of girth 5 on k 2 + 1 vertices for k = 2, 3, 4. (c) incidence graph of a nite projective plane has girth six. (d) every strict acyclic digraph contains an arc whose reversal results in an acyclic digraph. A triangle free graph is the one which contains no triangles. Let G be a simple triangle free graph. (a) Show that d(v) + d(u) n for all edges uv 2 (b) Deduce that d(v) mn
vV

(c) For each n > 0 nd a simple triangle free graph G with m = n2 /4. (d) Let G be a triangle free graph with minimum degree > 2n/5. Then G is bipartite. (e) For n 0(mod5) nd a non bipartite triangle free graph with = 2n/5. (9) Let P = (X, ) be a POSET. A set of pairwise incomparable elements of P is called an antichain. Show that the maximum number of elements in a chain of P is equal to the minimum number of antichains into which X can be partitioned.
1

(10) Let T be a tournament on n vertices and let v be a vertex of T . Show that the number of directed 2paths in T whose central vertex is v is at most (n 1)2 /4. When does equality hold? Show that the total number of directed 2paths in T is at most n(n 1)2 /4.