Directions: Solve the following problems. All written work must be your own. See the course syllabus for detailed rules.

  1. [2.1.{25,26}] Recall that the slope of the line segment joining the pair of points (x1,y1) and (x2,y2) in the plane is (y2 y1)(x2 x1).

    1. Prove that if S as a set of 17 points in the plane, no two of which are on a common vertical or horizontal line, then there exist p1,,p5 S such that the slope of the line segments joining pi and pj for 1 i < j 5 all have the same sign.
    2. Give an example that shows that the conclusion of part (a) does not always hold if we assume only that |S| 16.
  2. [2.2.3] What is the maximum number of edges in an n-vertex bipartite graph? Prove your answer is correct.
  3. [2.2.6] Each of 9 users sends three friend requests on a social media platform. Is it possible that each person p receives exactly 3 friend requests from the same three people to whom p sent the requests? What if the number of users is 8 instead?
  4. [2.2.13] Show that the two graphs below are isomorphic.

      [Picture] [Picture]