| Publication | Date of Publication | Type |
|---|
On Ruzsa's discrete Brunn-Minkowski conjecture
Proceedings of the American Mathematical Society | 2025-01-22 | Paper |
On the length of directed paths in digraphs
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
The sharp doubling threshold for approximate convexity
Bulletin of the London Mathematical Society | 2024-11-07 | Paper |
Sharp bounds for a discrete John's theorem
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
On the largest product-free subsets of the alternating groups
Inventiones Mathematicae | 2024-08-12 | Paper |
Forbidden intersections for codes
Journal of the London Mathematical Society | 2023-12-19 | Paper |
Hypercontractivity for global functions and sharp thresholds
Journal of the American Mathematical Society | 2023-10-19 | Paper |
Dynamic concentration of the triangle‐free process
Random Structures & Algorithms | 2023-10-11 | Paper |
Isoperimetric stability in lattices
Proceedings of the American Mathematical Society | 2023-10-11 | Paper |
Sharp bounds for the Tao-Vu Discrete John's Theorem
| 2023-09-21 | Paper |
Homomorphisms from the torus
Advances in Mathematics | 2023-08-28 | Paper |
Sharp hypercontractivity for symmetric groups and its applications
| 2023-07-27 | Paper |
On Ruzsa's discrete Brunn-Minkowski conjecture
| 2023-06-22 | Paper |
The sharp doubling threshold for approximate convexity
| 2023-04-03 | Paper |
The optimal edge-colouring threshold
| 2022-12-08 | Paper |
The existence of subspace designs
| 2022-12-01 | Paper |
Finding matchings in dense hypergraphs
| 2022-10-23 | Paper |
On the Largest Product-free Subsets of the Alternating Groups
| 2022-05-30 | Paper |
New bounds for Ryser’s conjecture and related problems
Transactions of the American Mathematical Society, Series B | 2022-04-22 | Paper |
The generalised Oberwolfach problem
Journal of Combinatorial Theory. Series B | 2021-11-17 | Paper |
The $n$-queens problem
| 2021-09-16 | Paper |
A universal exponent for homeomorphs
Israel Journal of Mathematics | 2021-08-24 | Paper |
Cycle-complete Ramsey numbers
IMRN. International Mathematics Research Notices | 2021-08-09 | Paper |
On the number of symbols that forces a transversal
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Global hypercontractivity and its applications
| 2021-03-08 | Paper |
Finding Perfect Matchings in Dense Hypergraphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Global rigidity of direction-length frameworks
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
Stability for vertex isoperimetry in the cube
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
HYPERGRAPH MATCHINGS AND DESIGNS
Proceedings of the International Congress of Mathematicians (ICM 2018) | 2020-09-22 | Paper |
Algorithms for \#BIS-hard problems on expander graphs
SIAM Journal on Computing | 2020-08-03 | Paper |
The Brown-Erd\H{o}s-S\'os Conjecture for hypergraphs of large uniformity
| 2020-07-29 | Paper |
Distinct degrees in induced subgraphs
Proceedings of the American Mathematical Society | 2020-07-21 | Paper |
Coloured and directed designs
Bolyai Society Mathematical Studies | 2020-07-08 | Paper |
Forbidden vector-valued intersections
Proceedings of the London Mathematical Society | 2020-07-03 | Paper |
Ringel's tree packing conjecture in quasirandom graphs
| 2020-04-21 | Paper |
Rainbow factors in hypergraphs
Journal of Combinatorial Theory. Series A | 2020-02-21 | Paper |
The extremal number of Venn diagrams
| 2019-11-01 | Paper |
Algorithms for #BIS-hard problems on expander graphs
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Counting Steiner triple systems
| 2018-11-14 | Paper |
Rainbow matchings in properly colored multigraphs
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
Counting designs
Journal of the European Mathematical Society (JEMS) | 2018-04-24 | Paper |
The existence of designs II
| 2018-02-16 | Paper |
Equiangular lines and spherical codes in Euclidean space
Inventiones Mathematicae | 2018-01-26 | Paper |
Equiangular lines and subspaces in Euclidean spaces
| 2018-01-18 | Paper |
A stability result for the cube edge isoperimetric inequality
Journal of Combinatorial Theory. Series A | 2018-01-12 | Paper |
The structure of typical eye-free graphs and a Turán-type result for two weighted colours
Combinatorics, Probability and Computing | 2017-10-27 | Paper |
On the normalized Shannon capacity of a union
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Frankl-Rödl-type theorems for codes and permutations
Transactions of the American Mathematical Society | 2016-11-16 | Paper |
Bounds for spherical codes
| 2016-02-24 | Paper |
A multipartite Hajnal-Szemerédi theorem
Journal of Combinatorial Theory. Series B | 2015-06-22 | Paper |
Spectral extremal problems for hypergraphs
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
A geometric theory for hypergraph matching
Memoirs of the American Mathematical Society | 2015-02-03 | Paper |
Polynomial-time perfect matchings in dense hypergraphs
Advances in Mathematics | 2014-11-26 | Paper |
Turán numbers of bipartite graphs plus an odd cycle
Journal of Combinatorial Theory. Series B | 2014-08-28 | Paper |
An approximate vertex-isoperimetric inequality for \(r\)-sets
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Polynomial-time perfect matchings in dense hypergraphs
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Dynamic concentration of the triangle-free process
| 2014-06-11 | Paper |
scientific article; zbMATH DE number 6302978 (Why is no real title available?)
| 2014-06-11 | Paper |
A hypergraph Turán theorem via Lagrangians of intersecting families
The Seventh European Conference on Combinatorics, Graph Theory and Applications | 2014-06-11 | Paper |
On a conjecture of Erdős and Simonovits: even cycles
Combinatorica | 2014-03-17 | Paper |
The existence of designs
| 2014-01-15 | Paper |
A hypergraph Turán theorem via Lagrangians of intersecting families
Journal of Combinatorial Theory. Series A | 2014-01-06 | Paper |
Digraph girth via chromatic number
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
Finding Hamilton cycles in robustly expanding digraphs
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
The Turán number of \(F_{3,3}\)
Combinatorics, Probability and Computing | 2012-06-04 | Paper |
A hypergraph blow-up lemma
Random Structures & Algorithms | 2011-10-25 | Paper |
scientific article; zbMATH DE number 5942358 (Why is no real title available?)
| 2011-08-24 | Paper |
A semiexact degree condition for Hamilton cycles in digraphs
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Bounded direction-length frameworks
Discrete & Computational Geometry | 2011-06-10 | Paper |
Necessary conditions for the global rigidity of direction-length frameworks
Discrete & Computational Geometry | 2011-06-10 | Paper |
Set systems without a simplex or a cluster
Combinatorica | 2011-04-26 | Paper |
Loose Hamilton cycles in hypergraphs
Discrete Mathematics | 2011-03-08 | Paper |
Pairwise intersections and forbidden configurations
| 2010-07-30 | Paper |
The early evolution of the \(H\)-free process
Inventiones Mathematicae | 2010-07-06 | Paper |
Pancyclicity of Hamiltonian and highly connected graphs
Journal of Combinatorial Theory. Series B | 2010-06-03 | Paper |
Directed graphs without short cycles
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Triangle packings and 1-factors in oriented graphs
Journal of Combinatorial Theory. Series B | 2009-06-23 | Paper |
A hypergraph regularity method for generalized Turán problems
Random Structures & Algorithms | 2009-03-04 | Paper |
An exact minimum degree condition for Hamilton cycles in oriented graphs
Journal of the London Mathematical Society | 2009-02-06 | Paper |
Shadows and intersections: Stability and new proofs
Advances in Mathematics | 2008-07-10 | Paper |
Set Systems with No Singleton Intersection
SIAM Journal on Discrete Mathematics | 2007-11-16 | Paper |
Codegree problems for projective geometries
Journal of Combinatorial Theory. Series B | 2007-10-10 | Paper |
Rainbow Turán Problems
Combinatorics, Probability and Computing | 2007-03-20 | Paper |
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
Journal of Combinatorial Theory. Series B | 2007-01-16 | Paper |
On a restricted cross-intersection problem
Journal of Combinatorial Theory. Series A | 2006-12-07 | Paper |
A random construction for permutation codes and the covering radius
Designs, Codes and Cryptography | 2006-11-22 | Paper |
Pairwise intersections and forbidden configurations
European Journal of Combinatorics | 2006-11-15 | Paper |
Bounding the number of edges in permutation graphs
The Electronic Journal of Combinatorics | 2006-08-30 | Paper |
Sparse halves in triangle-free graphs
Journal of Combinatorial Theory. Series B | 2006-07-12 | Paper |
On a hypergraph Turán problem of Frankl
Combinatorica | 2006-06-27 | Paper |
The Turán number of the Fano plane
Combinatorica | 2006-06-27 | Paper |
The Turán problem for hypergraphs on fixed size
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
The Turán problem for projective geometries
Journal of Combinatorial Theory. Series A | 2005-09-28 | Paper |
Disjoint representability of sets and their complements
Journal of Combinatorial Theory. Series B | 2005-09-28 | Paper |
Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
Journal of the London Mathematical Society | 2005-03-14 | Paper |
Packing triangles in a graph and its complement
Journal of Graph Theory | 2005-02-16 | Paper |
Multicolour Turán problems
Advances in Applied Mathematics | 2004-10-12 | Paper |
Stability theorems for cancellative hypergraphs
Journal of Combinatorial Theory. Series B | 2004-10-01 | Paper |
Multicoloured extremal problems
Journal of Combinatorial Theory. Series A | 2004-10-01 | Paper |
The characteristic polynomial of a random permutation matrix.
Stochastic Processes and their Applications | 2004-09-22 | Paper |
On the number of edges not covered by monochromatic copies of a fixed graph.
Journal of Combinatorial Theory. Series B | 2004-03-15 | Paper |
Local Density in Graphs with Forbidden Subgraphs
Combinatorics, Probability and Computing | 2003-09-24 | Paper |
On the length of directed paths in digraphs
| N/A | Paper |
Balanced two-type annihilation: mean-field asymptotics
| N/A | Paper |
Dissipative particle systems on expanders
| N/A | Paper |
Locality in Sumsets
| N/A | Paper |
Long induced paths in expanders
| N/A | Paper |
