2016
In 2016, we meet on Thursdays, 12:30 — 13:30 (at Nuffield G21).
- Tássio Naia (21 Jan). Dependent Random Choice and Turán number for bipartite graphs.
- Jie Han (28 Jan). Further applications of Dependent Random Choice (1-subdivision of \(K_n\), Ramsey number of the cube, Ramsey-Turán for \(K_4\)-free graphs).
- Frederik Garbe (4 Feb). Turán number for \(K_{s,t}\) (probabilistic bounds, algebraic constructions).
- Stefan Glock (11 Feb). Extremal Graphs with no \(C_4, C_6\) or \(C_{10}\) (R. Wenger paper, 1989).
- Tássio Naia (18 Feb). Linear algebra and algorithms (3 miniatures of Matoušek)
- Jie Han (25 Feb). More Linear Algebra: decomposition of complete graphs into complete bipartite graphs (Graham–Pollak), unique-distance and two-distance sets (Larman–Rogers–Seidel), Eventown.
- Nicolás Sanhueza-Matamala (3 Mar). More intersecting families! The Ray–Chaudhuri–Wilson Inequality and the Modular Frankl–Wilson Inequality.
- Nicolás Sanhueza-Matamala (10 Mar). The Polynomial Method; DeMillo-Lipton-Schwartz-Zippel lemma.
- Jie Han (17 Mar). Kayeka's problem in finite fields.
- Robert Hancock (14 Apr). Number of maximal independend sets in a graph (Erdős–Moser).
- Nicolás Sanhueza-Matamala (12 Jun). The Cap Set problem.
2015
In 2015, we met every Wednesday, 12:30 — 13:30.
- (4 Nov). Second moment: estimate \(\binom{2m}{m}\); threshold functions, subgraphs of random graph.
- Frederik Garbe (11 Nov). Lovász Local Lemma (2 versions), and an application: bounding the Ramsey number.
- Wei En Tan (18 Nov). Strong Concentration Around Expectation. Chernoff bounds, Randomized Rounding, for the k-matching problem.
- Robert Hancock (25 Nov). Strong Concentration (continued). Combinatorial discrepancy (upper and lower bounds).
- Nicolás Sanhueza-Matamala (2 Dec). Concentration of Lipschitz Functions. Shamir–Spencer concentration of \(\chi(G(n,p))\).
- Stefan Glock (9 Dec). Talagrand's Inequality; concentration of the largest eigenvalue of a random symmetric matrix.