| Publication | Date of Publication | Type |
|---|
Partitioning problems via random processes
Journal of the London Mathematical Society. Second Series | 2025-01-08 | Paper |
Cohomology groups of non-uniform random simplicial complexes
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| The sparse parity matrix | 2024-07-19 | Paper |
| Partitioning problems via random processes | 2023-07-12 | Paper |
On a question of Vera T. Sós about size forcing of graphons
Acta Mathematica Hungarica | 2023-01-23 | Paper |
Loose cores and cycles in random hypergraphs
The Electronic Journal of Combinatorics | 2022-11-08 | Paper |
| The emergence of a giant rainbow component | 2022-10-21 | Paper |
Phase transition in cohomology groups of non-uniform random simplicial complexes
The Electronic Journal of Combinatorics | 2022-08-04 | Paper |
| High-order bootstrap percolation in hypergraphs | 2022-01-24 | Paper |
| Warning Propagation: stability and subcriticality | 2021-11-30 | Paper |
Longest paths in random hypergraphs
SIAM Journal on Discrete Mathematics | 2021-11-04 | Paper |
| The sparse parity matrix | 2021-07-13 | Paper |
| Vanishing of cohomology groups of random simplicial complexes | 2021-06-15 | Paper |
| Paths, cycles and sprinkling in random hypergraphs | 2021-03-30 | Paper |
Large induced matchings in random graphs
SIAM Journal on Discrete Mathematics | 2021-03-17 | Paper |
On a question of Vera T. S\'os about size forcing of graphons
(available as arXiv preprint) | 2021-03-16 | Paper |
| Warning Propagation on random graphs | 2021-02-01 | Paper |
Multi-coloured jigsaw percolation on random graphs
Journal of Combinatorics | 2021-01-29 | Paper |
Subcritical random hypergraphs, high-order components, and hypertrees
SIAM Journal on Discrete Mathematics | 2020-10-27 | Paper |
Vanishing of cohomology groups of random simplicial complexes
Random Structures & Algorithms | 2020-06-19 | Paper |
The sharp threshold for jigsaw percolation in random graphs
Advances in Applied Probability | 2019-12-09 | Paper |
Subcritical random hypergraphs, high-order components, and hypertrees
2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-18 | Paper |
Core forging and local limit theorems for the \(k\)-core of random graphs
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
The size of the giant component in random hypergraphs: a short proof
The Electronic Journal of Combinatorics | 2019-07-11 | Paper |
The size of the giant component in random hypergraphs: a short proof
The Electronic Journal of Combinatorics | 2019-07-11 | Paper |
Largest components in random hypergraphs
Combinatorics, Probability and Computing | 2018-11-05 | Paper |
Jigsaw percolation on random hypergraphs
Journal of Applied Probability | 2018-09-26 | Paper |
The size of the giant high-order component in random hypergraphs
Random Structures & Algorithms | 2018-09-25 | Paper |
Homological connectedness of random hypergraphs
(available as arXiv preprint) | 2018-01-18 | Paper |
How does the core sit inside the mantle?
Random Structures & Algorithms | 2017-10-24 | Paper |
The minimum bisection in the planted bisection model
Theory of Computing | 2017-10-11 | Paper |
The minimum bisection in the planted bisection model
(available as arXiv preprint) | 2017-08-31 | Paper |
The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
Discrete Mathematics | 2017-08-29 | Paper |
Evolution of high-order connected components in random hypergraphs
(available as arXiv preprint) | 2016-10-14 | Paper |
Tight cycles in hypergraphs
(available as arXiv preprint) | 2016-10-14 | Paper |
| Regular slices for hypergraphs | 2016-10-14 | Paper |
How does the core sit inside the mantle?
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Threshold and hitting time for high-order connectedness in random hypergraphs
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
Threshold and hitting time for high-order connectedness in random hypergraphs
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
| The size of the giant component in random hypergraphs | 2015-01-30 | Paper |
Loebl-Komlós-Sós conjecture: dense case
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Minimum degree conditions for large subgraphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
Combinatorica | 2010-08-13 | Paper |
Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
Discrete Mathematics | 2009-12-15 | Paper |
Ramsey numbers of sparse hypergraphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
3-uniform hypergraphs of bounded degree have linear Ramsey numbers
Journal of Combinatorial Theory. Series B | 2008-04-28 | Paper |
Perfect packings with complete graphs minus an edge
European Journal of Combinatorics | 2007-11-21 | Paper |
