artículo académico

• Blowing up Dirac's theorem.  BULLETIN OF THE LONDON MATHEMATICAL SOCIETY.  58(1). 2026
• Separating path systems in trees.  JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS.  208(2). 2026
• The codegree Turán density of 3-uniform tight cycles.  JOURNAL OF COMBINATORIAL THEORY SERIES B.  176:1-6. 2026
• Color-bias perfect matchings in hypergraphs.  SIAM JOURNAL ON DISCRETE MATHEMATICS.  39(3):1894-1916. 2025
• Ramsey numbers of cycles in random graphs.  RANDOM STRUCTURES & ALGORITHMS.  66(1). 2025
• Separating Path Systems in Complete Graphs.  RANDOM STRUCTURES & ALGORITHMS.  66(3). 2025
• Cycle decompositions in k-uniform hypergraphs.  JOURNAL OF COMBINATORIAL THEORY SERIES B.  167:55-103. 2024
• Dirac-type conditions for spanning bounded-degree hypertrees.  JOURNAL OF COMBINATORIAL THEORY SERIES B.  165:97-141. 2024
• Cycle Decompositions in 3-Uniform Hypergraphs.  COMBINATORICA.  43(1):1-36. 2023
• On sufficient conditions for spanning structures in dense graphs.  PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY.  127(3):709-791. 2023
• Ramsey Numbers with Prescribed Rate of Growth.  ELECTRONIC JOURNAL OF COMBINATORICS.  30(3). 2023
• Towards a hypergraph version of the Pósa-Seymour conjecture.  ADVANCES IN COMBINATORICS.  2023. 2023
• Minimum degree conditions for tight Hamilton cycles.  JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES.  105(4):2249-2323. 2022