Probabilistic combinatorics and the recent work of Peter Keevash

DOI10.1090/bull/1553zbMath1351.05074OpenAlexW2519715328WikidataQ61979614 ScholiaQ61979614MaRDI QIDQ3178750

Timothy Gowers

Publication date: 20 December 2016

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/bull/1553

zbMATH Keywords

pairwise balanced designsRandom walks in random groups

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial probability (60C05) Other designs, configurations (05B30) Coloring of graphs and hypergraphs (05C15) Random walks on graphs (05C81) Graph designs and isomorphic decomposition (05C51)

Related Items (3)

On a Combinatorial Generation Problem of Knuth ⋮ A short proof of the middle levels theorem ⋮ A constant-time algorithm for middle levels Gray codes

Cites Work

• Unnamed Item
• Unnamed Item
• On a packing and covering problem
• A dense infinite Sidon sequence
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Random walk in random groups.
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• Proof of the middle levels conjecture
• Graph Theory and Probability
• Some remarks on the theory of graphs

This page was built for publication: Probabilistic combinatorics and the recent work of Peter Keevash