probmethod_notes.pdf

yufeizhao.com · 10,063 words · saved by 1 readers

N/A

Lecture notes (MIT 18.226, Fall 2020) Probabilistic Methods in Combinatorics Yufei Zhao Massachusetts Institute of Technology yufeiz@mit.edu http://yufeizhao.com/pm/ Contents 1 Introduction 1 1.1 Lower bounds to Ramsey numbers . . . . . . . . . . . . . . . . . . . . . . 1 1.1.1 Erdős’ original proof . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.1.2 Alteration method . . . . . . . . . . . . . . . . . . .…

saved by

Didier Lampard

related reading

[2408.01709] A spectral Lovász-Simonovits theoremarxiv.org
[2608.00140] Discrepancy Theory: An Algorithmic and Geometric Perspectivearxiv.org
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizesarxiv.org
CSE290A - Randomized Algorithmsusers.soe.ucsc.edu
Ramsey theory and strength of graphsarxiv.org
A simpler proof of the KPR theorem | tcs mathtcsmath.wordpress.com
Nike Sunmath.mit.edu
CSE 599 Recent Developments in Approximation Algorithmshomes.cs.washington.edu
Tim Gowers - Two culturesdpmms.cam.ac.uk
rainbow-turan-full-version.pdfpeople.maths.ox.ac.uk
nullstellensatzweb.math.princeton.edu
gtacbook.pdfyufeizhao.com