Unformatted text preview: mum number of edges G can have? Problem 5: You are given a standard 8 by 8 chessboard where each square has length 1. Is it possible to place 2 by 1 paper rectangles on the board so that all of the squares are covered except for two opposite corners? (Rectangles must be placed so they cover exactly two squares of the board and do not overlap) Demonstrate a valid tiling or prove none exists. Problem 6: a) Prove that every graph on 6 vertices either contains a 3cycle or a set of 3 vertices that are pairwise nonadjacent; b) Show that the above statement is not true for graphs on 5 vertices. 1...
View
Full Document
 Spring '09
 M.PEI
 Math, Graph Theory, vertices, Bipartite graph

Click to edit the document details