| The Sparse Parity Matrix | 0 | 0.34 | 2022 |
| Loose Cores and Cycles in Random Hypergraphs. | 0 | 0.34 | 2022 |
| LONGEST PATHS IN RANDOM HYPERGRAPHS | 0 | 0.34 | 2021 |
| Large Induced Matchings In Random Graphs | 0 | 0.34 | 2021 |
| Subcritical Random Hypergraphs, High-Order Components, And Hypertrees | 0 | 0.34 | 2020 |
| Vanishing of cohomology groups of random simplicial complexes | 0 | 0.34 | 2020 |
| The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph. | 1 | 0.37 | 2017 |
| Jigsaw percolation on random hypergraphs. | 0 | 0.34 | 2017 |
| Homological connectedness of random hypergraphs. | 0 | 0.34 | 2017 |
| Tight cycles and regular slices in dense hypergraphs. | 4 | 0.50 | 2017 |
| Threshold and hitting time for high-order connectedness in random hypergraphs | 3 | 0.58 | 2016 |
| Regular slices for hypergraphs | 0 | 0.34 | 2015 |
| Evolution of high-order connected components in random hypergraphs | 1 | 0.35 | 2015 |
| Tight Cycles in Hypergraphs | 0 | 0.34 | 2015 |
| Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs | 5 | 0.53 | 2009 |
| Loebl-Komlós-Sós Conjecture: dense case | 3 | 0.49 | 2009 |
| Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs | 5 | 0.95 | 2009 |
| Minimum degree conditions for large subgraphs | 1 | 0.41 | 2009 |
| 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers | 12 | 0.79 | 2008 |
| Ramsey numbers of sparse hypergraphs | 0 | 0.34 | 2007 |
| Perfect packings with complete graphs minus an edge | 4 | 0.47 | 2007 |
