Scribd
Upload
66 views1 page

Homework 1

The document outlines three problems in graph theory: 1) For any graph with more than k^k nodes, it contains either a clique or independent set of at least k nodes. The same cannot be proven for graphs with fewer than k^k nodes. 2) For any α, β > 0 such that αβ < 1, there exists an integer d such that a d-regular bipartite graph can serve as an (α, β) expander for sufficiently large sets of nodes. 3) In a nontransitive d-regular graph, there exists an independent set of at least nlogd/8d nodes. This can be shown by considering

Uploaded by

JeremyKun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PS, PDF, TXT or read online on Scribd
66 views1 page

Homework 1

The document outlines three problems in graph theory: 1) For any graph with more than k^k nodes, it contains either a clique or independent set of at least k nodes. The same cannot be proven for graphs with fewer than k^k nodes. 2) For any α, β > 0 such that αβ < 1, there exists an integer d such that a d-regular bipartite graph can serve as an (α, β) expander for sufficiently large sets of nodes. 3) In a nontransitive d-regular graph, there exists an independent set of at least nlogd/8d nodes. This can be shown by considering

Uploaded by

JeremyKun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PS, PDF, TXT or read online on Scribd
You are on page 1/ 1

princeton university F02 cos 597D: a theorists toolkit

Homework 1
Out: September 16 Due: September 23
You can collaborate with your classmates, but be sure to list your collaborators with your
answer. If you get help from a published source (book, paper etc.), cite that. Also, limit
your answers to one page or less you just need to give enough detail to convince me. If
you suspect a problem is open, just say so and give reasons for your suspicion.
1 For every integer k 1 show that any graph with more than k
k
nodes has either a
clique or an independent set of size at least k. (Moral: A graph cannot be completely
disordered: there is always some local order in it.) Can you prove the same statement
for graphs with fewer than k
k
nodes?
2 A bipartite graph G = (V
1
, V
2
, E) with |V
1
| = |V
2
| is said to be an (, ) expander if
every subset S V
1
of size at most |V
1
| has at least |S| neighbors in V
2
. Show
that for every , > 0 satisfying < 1 there is an integer d such that a d-regular
expander exists for every large enough |V
1
|.
3 A graph is said to be nontransitive if there is no triple of vertices i, j, k such that all
of {i, j} , {j, k} , {k, i} are edges. Show that in a nontransitive d-regular graph, there
is an independent set of size at least nlog d/8d. (Hint: Suppose we try to pick an
independent set S randomly from all independent sets in the graph. For any vertex
v, suppose you have picked the portion of S except for v and the neighbors of v. How
would you pick the rest of S?)
1

You might also like