Homework Assignment 6

Given: July 01, 2004 Due: July 08, 2004

This assignment is due by the end of lass on the due date. The point value of ea h
problem is shown in [ ℄. Ea h solution must be the student's own work. Assistan e should
be sought or a epted only from the ourse instru tor. Any violation of this rule will be
dealt with harshly.

Problems to Submit

1. Problem 30 on page 109 of the text.

2. There are 42 students who are to share 12 omputers. Ea h student uses exa tly 1
omputer and no omputer is used by more than 6 students. Show that at least 5 omputers
are used by 3 or more students.

3. In the mound splitting game, you start o with a single pile of pebbles. In ea h move,
you an remove an existing pile of k pebbles and repla e it by two piles (say, k1 and k2
pebbles, where k1 + k2 = k). On doing this you get paid k1 Xk2 . Clearly, as long as there is
a pile with more than one pebble, you an make more money; hen e the game stops when
there are n \piles" with one stone ea h.
How an you maximize the amount of money you make? Prove that this amount is
indeed the maximum.

4. Prove or disprove the following. In any group of two or more people, there are always
at least two people who have the same number of friends. Assume that if a person p is a
friend of a person q then q is also a friend of p.

5. Does every set of six people ontain three mutual a quaintan es or three mutual
strangers? Prove your answer. Assume that \a quaintan e" is symmetri .

6. Prove that a graph is bipartite i it does not ontain any odd-length y les. Assume
that the graph is simple.

7. Show that if G is a bipartite simple graph with v verti es and e edges then e  v2 =4.