Interview with Joel Spencer
From MaRDI portal
Publication:6659964
DOI10.54550/ECA2023V3S3I7MaRDI QIDQ6659964FDOQ6659964
Authors: Toufik Mansour 
Publication date: 9 January 2025
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Cites Work
- The strange logic of random graphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Some remarks on the theory of graphs
- A new proof of Szemerédi's theorem
- The triangle-free process
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
- Improved bounds and algorithms for hypergraph 2-coloring
- A note on random greedy coloring of uniform hypergraphs
- Graph limits and parameter testing
- Title not available (Why is that?)
- Achlioptas process phase transitions are continuous
- Birth control for giants
- The Bohman-Frieze process near criticality
- Counting Steiner triple systems
- On the polynomial Szemerédi theorem in finite fields
- Random sum-free subsets of abelian groups
- Interview with Noga Alon
This page was built for publication: Interview with Joel Spencer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659964)
