| Publication | Date of Publication | Type |
|---|
Independent sets in discrete tori of odd sidelength
SIAM Journal on Discrete Mathematics | 2025-10-10 | Paper |
The large N factorization does not hold for arbitrary multi-trace observables in random tensors
Letters in Mathematical Physics | 2025-09-16 | Paper |
| A characterization of testable hypergraph properties | 2025-08-06 | Paper |
| How to determine if a random graph with a fixed degree sequence has a giant component | 2025-08-06 | Paper |
A characterization of testable hypergraph properties
Journal of Combinatorial Theory. Series B | 2025-07-29 | Paper |
| Random perfect matchings in regular graphs (extended abstract) | 2025-04-15 | Paper |
Sufficient conditions for perfect mixed tilings
Journal of Combinatorial Theory. Series B | 2024-12-12 | Paper |
Resolution of the Oberwolfach problem
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Ramsey theory constructions from hypergraph matchings
Proceedings of the American Mathematical Society | 2024-10-18 | Paper |
Counting oriented trees in digraphs with large minimum semidegree
Journal of Combinatorial Theory. Series B | 2024-07-01 | Paper |
On the \((6,4)\)-problem of Brown, Erdős, and Sós
Proceedings of the American Mathematical Society. Series B | 2024-06-27 | Paper |
| Conflict-free hypergraph matchings | 2024-05-14 | Paper |
Random perfect matchings in regular graphs
Random Structures & Algorithms | 2024-01-05 | Paper |
| Robust Hamiltonicity | 2023-12-23 | Paper |
Hypergraph regularity and random sampling
Random Structures & Algorithms | 2023-10-23 | Paper |
Fractional cycle decompositions in hypergraphs
Random Structures & Algorithms | 2023-10-17 | Paper |
| Independent sets in discrete tori of odd sidelength | 2023-10-04 | Paper |
| Counting oriented trees in digraphs with large minimum semidegree | 2023-05-24 | Paper |
Counting Hamilton cycles in Dirac hypergraphs
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
A Short proof of the blow-up lemma for approximate decompositions
Combinatorica | 2023-01-23 | Paper |
Decomposing hypergraphs into cycle factors
Journal of Combinatorial Theory. Series B | 2022-11-28 | Paper |
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
Transactions of the American Mathematical Society | 2022-10-12 | Paper |
| On the $(6,4)$-problem of Brown, Erd\H{o}s and S\'os | 2022-09-28 | Paper |
| Ramsey theory constructions from hypergraph matchings | 2022-08-26 | Paper |
| Conflict-free hypergraph matchings | 2022-05-11 | Paper |
| Sufficient conditions for perfect mixed tilings | 2022-01-11 | Paper |
Percolation on random graphs with a fixed degree sequence
SIAM Journal on Discrete Mathematics | 2022-01-07 | Paper |
The edge-Erdős-Pósa property
Combinatorica | 2021-09-22 | Paper |
Resolution of the Oberwolfach problem
Journal of the European Mathematical Society (JEMS) | 2021-07-05 | Paper |
Pseudorandom hypergraph matchings
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Erdős-Pósa property for labeled minors: 2-connected minors
SIAM Journal on Discrete Mathematics | 2021-05-28 | Paper |
Decomposing hypergraphs into cycle factors
(available as arXiv preprint) | 2021-04-13 | Paper |
Euler tours in hypergraphs
Combinatorica | 2021-03-20 | Paper |
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Forum of Mathematics, Sigma | 2020-11-20 | Paper |
A rainbow blow-up lemma
Random Structures & Algorithms | 2020-10-26 | Paper |
On a rainbow version of Dirac's theorem
Bulletin of the London Mathematical Society | 2020-07-27 | Paper |
Spanning trees in randomly perturbed graphs
Random Structures & Algorithms | 2020-06-19 | Paper |
A short proof of the blow-up lemma for approximate decompositions
(available as arXiv preprint) | 2020-01-10 | Paper |
Optimal packings of bounded degree trees
Journal of the European Mathematical Society (JEMS) | 2019-12-12 | Paper |
Edge correlations in Random regular hypergraphs and applications to subgraph testing
SIAM Journal on Discrete Mathematics | 2019-10-25 | Paper |
A unified Erdős-Pósa theorem for constrained cycles
Combinatorica | 2019-05-23 | Paper |
Long cycles have the Edge-Erdős-Pósa property
Combinatorica | 2019-05-23 | Paper |
On the hard sphere model and sphere packings in high dimensions
Forum of Mathematics, Sigma | 2019-01-16 | Paper |
On kissing numbers and spherical codes in high dimensions
Advances in Mathematics | 2018-08-29 | Paper |
On kissing numbers and spherical codes in high dimensions
Advances in Mathematics | 2018-08-29 | Paper |
Frames, \(A\)-paths, and the Erdős-Pósa property
SIAM Journal on Discrete Mathematics | 2018-06-07 | Paper |
Critical percolation on random regular graphs
Proceedings of the American Mathematical Society | 2018-06-04 | Paper |
Paths and cycles in random subgraphs of graphs with large minimum degree
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Paths and cycles in random subgraphs of graphs with large minimum degree
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Long cycles through prescribed vertices have the Erdős-Pósa property
Journal of Graph Theory | 2018-04-27 | Paper |
How to determine if a random graph with a fixed degree sequence has a giant component
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2018-02-12 | Paper |
How to determine if a random graph with a fixed degree sequence has a giant component
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2018-02-12 | Paper |
A stronger bound for the strong chromatic index
Combinatorics, Probability and Computing | 2018-01-19 | Paper |
Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs
Journal of Graph Theory | 2017-08-10 | Paper |
| A characterization of testable hypergraph properties | 2017-07-11 | Paper |
Induced cycles in graphs
Graphs and Combinatorics | 2017-01-13 | Paper |
Parity linkage and the Erdős-Pósa property of odd cycles through prescribed vertices in highly connected graphs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
| On graphs with induced matching number almost equal to matching number | 2016-10-17 | Paper |
| A stronger bound for the strong chromatic index (extended abstract) | 2016-10-14 | Paper |
Induced matchings in graphs of bounded maximum degree
SIAM Journal on Discrete Mathematics | 2016-10-10 | Paper |
Long cycles have the edge-Erd\H{o}s-P\'osa property
(available as arXiv preprint) | 2016-07-07 | Paper |
Structural parameterizations for boxicity
Algorithmica | 2016-05-31 | Paper |
Induced 2-regular subgraphs in k-chordal cubic graphs
Discrete Applied Mathematics | 2016-04-07 | Paper |
The cycle spectrum of claw-free Hamiltonian graphs
Graphs and Combinatorics | 2016-03-02 | Paper |
Induced matchings in graphs of degree at most 4
SIAM Journal on Discrete Mathematics | 2016-02-05 | Paper |
Random Subgraphs in Sparse Graphs
SIAM Journal on Discrete Mathematics | 2015-12-04 | Paper |
Structural parameterizations for boxicity
Lecture Notes in Computer Science | 2015-09-09 | Paper |
A characterization of mixed unit interval graphs
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Equality of distance packing numbers
Discrete Mathematics | 2015-08-05 | Paper |
A note on longest paths in circular arc graphs
Discussiones Mathematicae Graph Theory | 2015-08-04 | Paper |
A characterization of mixed unit interval graphs
Journal of Graph Theory | 2015-07-23 | Paper |
Maximum induced matchings close to maximum matchings
Theoretical Computer Science | 2015-06-11 | Paper |
Badly-covered graphs
Discrete Applied Mathematics | 2015-02-06 | Paper |
Forests and trees among Gallai graphs
Discrete Mathematics | 2014-11-20 | Paper |
A characterization of substar graphs
Discrete Applied Mathematics | 2014-08-26 | Paper |
Domination and total domination in cubic graphs of large girth
Discrete Applied Mathematics | 2014-08-22 | Paper |
| Induced Matchings in Graphs of Maximum Degree 4 | 2014-07-31 | Paper |
Graphs of interval count two with a given partition
Information Processing Letters | 2014-06-23 | Paper |
Induced matchings in subcubic graphs
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Relating ordinary and total domination in cubic graphs of large girth
The Seventh European Conference on Combinatorics, Graph Theory and Applications | 2014-06-11 | Paper |
Independence and matching number in graphs with maximum degree 4
Discrete Mathematics | 2014-03-07 | Paper |
Ramsey results for cycle spectra
Journal of Graph Theory | 2013-10-21 | Paper |
Random subgraphs in Cartesian powers of regular graphs
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
