Combinatória 2016: Lista I

1. Show that every graph (of order at least 2) has two vertices of the same degree.

2. Show that Rp3, 3q “ 6, Rp3, 4q ď 9, Rp4, 4q ď 18 and Rp3, 3, 3q ď 17.

3. Show that every graph G has a bipartite subgraph with at least epGq{2 edges.

4. Determine rpK3 , C4 q and rpK3 , C5 q.

5. Prove that a tree (“ connected, acyclic graph) with k vertices has exactly k ´ 1 edges.

6. Prove that a graph with average degree at least 2d contains a subgraph with minimum
degree at least d.

7. Prove that a graph with minimum degree at least k ´ 1 contains every tree on k vertices.

8. Show that expn, T q ď pk ´ 1qn for every tree T with k vertices, and that expn, Hq " n
for every graph H that contains a cycle.

9. Show that rpK3 , T q “ 2k ´ 1 for every tree T with k vertices.

10. Determine the threshold in Gpn, pq for the property “every edge is contained in a trian-
gle”.

11. Determine expn, Cn q, the maximum number of edges in a graph on n vertices without a
cycle through all of the vertices.

12. Show that there is an infinite set S of positive integers such that the sum of any two
distinct elements of S has an even number of distinct prime factors.

13. Let gpnq be the largest integer m such that there exists a graph with the following
properties: vpGq “ n, epGq “ m and it is possible to red-blue colour the edges of G without
creating a monochromatic triangle.
` ˘
Show that gpnq{ n2 converges, and determine the limit as n Ñ 8.