| 619 | -- | 637 | Oliver Riordan. Random cliques in random graphs and sharp thresholds for F $$ F $$ -factors |
| 638 | -- | 665 | Prateek Bhakta, Sarah Miracle, Dana Randall, Amanda Pascoe Streib. Mixing times of Markov chains for self-organizing lists and biased permutations |
| 666 | -- | 677 | Nemanja Draganic, Stefan Glock, Michael Krivelevich. The largest hole in sparse random graphs |
| 678 | -- | 709 | Weiming Feng 0001, Heng Guo 0001, Yitong Yin. Perfect sampling from spatial mixing |
| 710 | -- | 723 | Keith Frankston, Jeff Kahn 0001, Jinyoung Park. On a problem of M. Talagrand |
| 724 | -- | 753 | Fotis Iliopoulos, Alistair Sinclair. Efficiently list-edge coloring multigraphs asymptotically optimally |
| 754 | -- | 802 | Lyuben Lichev, Dieter Mitsche. On the modularity of 3-regular random graphs and random graphs with given degree sequences |
| 803 | -- | 843 | Grégory Miermont, Sanchayan Sen. On breadth-first constructions of scaling limits of random graphs and random unicellular maps |
| 844 | -- | 908 | Samantha Petti, Santosh S. Vempala. Approximating sparse graphs: The random overlapping communities model |