Probabilistic combinatorics and the recent work of Peter Keevash

DOI10.1090/BULL/1553zbMATH Open1351.05074OpenAlexW2519715328WikidataQ61979614 ScholiaQ61979614MaRDI QIDQ3178750FDOQ3178750

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

• Graph Theory and Probability
• On a packing and covering problem
• Some remarks on the theory of graphs
• The probabilistic method
• Random walk in random groups.
• 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
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• Title not available (Why is that?)
• A dense infinite Sidon sequence
• Proof of the middle levels conjecture

Cited In (3)

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

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)