Homework 3	Due 4/20	.tex	.pdf
Homework 2	Due 3/23	.tex	.pdf
Homework 1	Due 2/9	.tex	.pdf

Paper:

Lecture date	Scribe	Topics	.tex	.pdf	Other files	Posted
W1: 1/10/06	R. Martin	Turán, Dirac (Pósa), König-Hall, Hajnal-Szemerédi, Ramsey, random methods	.tex	.pdf		01/11
W1: 1/12/06
W2: 1/17/06	D. Ray	Bipartite subgraphs, probability theory, Markov's inequality, introduction to random graphs	.tex	.pdf	drpic01.tex drpic02.tex	01/26
W2: 1/19/06	J. Manske	Markov's inequality, Chebyshev's inequality, second moment method, clique number of random graph	.tex	.pdf		02/02
W3: 1/26/06	C. Brewbaker	Clique number of the random graph, chromatic number of the random graph, more second moment, Chernoff bound	.tex	.pdf		02/08
W4: 1/31/06	T. Zick	More with the Chernoff bound, random bipartite graphs	.tex	.pdf		02/21
W4: 2/02/06	T. Zick	ε-regular pairs, intersection property	.tex	.pdf		02/21
W5: 2/07/06	R. Martin	Proof of RegLem, a quick application of RegLem and the Intersection Property	.tex	.pdf		02/14
W5: 2/09/06
W6: 2/14/06
W6: 2/16/06	J. Manske	Regular subpairs, finding complete multipartite graphs in ε-regular tuples, Erdõs-Stone	.tex	.pdf		03/07
W7: 2/21/06	D. Ray	Regularity Lemma (degree form), Key Lemma, number of copies of H, covering copies of H	.tex	.pdf		02/28
W7: 2/23/06	E. Hansen	Early applications of regularity lemma, (6,3)-configuration	.tex	.pdf	ehfano.JPG ehm1to3.JPG ehbip1.JPG ehTuranEx.JPG ehdist3.JPG ehk4es.JPG	04/20
W8: 2/28/06	C. Brewbaker	Blow-up lemma and tiling results	.tex	.pdf		04/04
W8: 3/02/06	J. Manske	Alon-Yuster Theorem	.tex	.pdf		03/07
W9: 3/07/06	R. Martin	Tripartite version of the Corrádi-Hajnal theorem				03/07
W9: 3/09/06
W10: 3/21/06
W10: 3/23/06
Special lecture series: 3/09/06, 3/22/06	R. Martin	Smoothed analysis of graphs: definitions, known results	Summary of known results:		Smoothed analysis papers: Bohman, Frieze, M., How many random edges make a dense graph hamiltonian? Bohman, Frieze, Krivelevich, M., Adding random edges to dense graphs Krivelevich, Sudakov, Tetali, On smoothed analysis in dense graphs and formulas Sudakov, Vondrák, How many random edges make a dense hypergraph non-2-colorable? Email me if there are any broken links.
			.tex	.pdf
W11: 3/28/06	O. Pryporova	Mean plus variance equals regularity	.tex	.pdf		04/08
W11: 3/30/06	E. Hansen	Slicing lemma, random slicing	.tex	.pdf		04/24
W12: 4/04/06	2002 course notes by N. Linial and A. Wigderson Email me if there are any broken links.	Introduction to expander graphs	.tex	.pdf	Lecture 2[PS] (D. Harnik) Lecture 1[PS] (R. Gilad-Bachrach) Lecture 3[PS] (B. Barak and U. Wiedler) Email me if there are any broken links.	04/04
W12: 4/06/06
W13: 4/11/06	O. Pryporova	Rapid mixing of expanders, Expander Mixing Lemma	.tex	.pdf		04/24
W13: 4/13/06	O. Pryporova	Basic definitions of Chung-Lu model, lemmas and propositions and examples	.tex	.pdf	Random graphs with given expected degree sequences: Chung, Lu, Connected components Chung, Lu, Average distances (short version) Chung, Lu, Vu, Eigenvalues Chung, Lu, The small world phenomenon Chung, Lu, The volume of the giant component Email me if there are any broken links.	04/24
W14: 4/18/06	T. Zick	More lemmas propositions and examples, average distance	.tex	.pdf		04/24
W14: 4/20/06	E. Hansen	Internet graph results: average distance	.tex	.pdf		05/23
W15: 4/25/06	D. Ray	Dominating sets, a probabilistic technique	.tex	.pdf	drgraph.JPG	04/25