Probabilistic combinatorics and the recent work of Peter Keevash

DOI10.1090/BULL/1553MaRDI QIDQ3178750zbMATHOpenAlexWikidataFDO

Authors W. 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)

Cites work

• scientific article; zbMATH DE number 1645816 (Why is no real title available?)
• A dense infinite Sidon sequence
• 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
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Graph Theory and Probability
• On a packing and covering problem
• Proof of the middle levels conjecture
• Random walk in random groups.
• Some remarks on the theory of graphs
• The probabilistic method

Cited in

(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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178750)