Publication | Date of Publication | Type |
---|
Forbidden intersections for codes | 2023-12-19 | Paper |
Hypercontractivity for global functions and sharp thresholds | 2023-10-19 | Paper |
Dynamic concentration of the triangle‐free process | 2023-10-11 | Paper |
Isoperimetric stability in lattices | 2023-10-11 | Paper |
Homomorphisms from the torus | 2023-08-28 | Paper |
New bounds for Ryser’s conjecture and related problems | 2022-04-22 | Paper |
The generalised Oberwolfach problem | 2021-11-17 | Paper |
A universal exponent for homeomorphs | 2021-08-24 | Paper |
Cycle-Complete Ramsey Numbers | 2021-08-09 | Paper |
On the number of symbols that forces a transversal | 2021-06-15 | Paper |
Finding Perfect Matchings in Dense Hypergraphs | 2021-02-02 | Paper |
Stability for vertex isoperimetry in the cube | 2020-09-24 | Paper |
Global rigidity of direction-length frameworks | 2020-09-24 | Paper |
HYPERGRAPH MATCHINGS AND DESIGNS | 2020-09-22 | Paper |
Algorithms for #BIS-Hard Problems on Expander Graphs | 2020-08-03 | Paper |
Distinct degrees in induced subgraphs | 2020-07-21 | Paper |
Coloured and Directed Designs | 2020-07-08 | Paper |
Forbidden vector‐valued intersections | 2020-07-03 | Paper |
Rainbow factors in hypergraphs | 2020-02-21 | Paper |
Algorithms for #BIS-hard problems on expander graphs | 2019-10-15 | Paper |
Counting Steiner triple systems | 2018-11-14 | Paper |
Rainbow Matchings in Properly Colored Multigraphs | 2018-07-18 | Paper |
Counting designs | 2018-04-24 | Paper |
Equiangular lines and spherical codes in Euclidean space | 2018-01-26 | Paper |
Equiangular lines and subspaces in Euclidean spaces | 2018-01-18 | Paper |
A stability result for the cube edge isoperimetric inequality | 2018-01-12 | Paper |
The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours | 2017-10-27 | Paper |
On the Normalized Shannon Capacity of a Union | 2017-10-10 | Paper |
Frankl-Rödl-type theorems for codes and permutations | 2016-11-16 | Paper |
A multipartite Hajnal-Szemerédi theorem | 2015-06-22 | Paper |
Spectral Extremal Problems for Hypergraphs | 2015-04-17 | Paper |
A geometric theory for hypergraph matching | 2015-02-03 | Paper |
Polynomial-time perfect matchings in dense hypergraphs | 2014-11-26 | Paper |
An approximate vertex-isoperimetric inequality for \(r\)-sets | 2014-08-14 | Paper |
Polynomial-time perfect matchings in dense hypergraphs | 2014-08-07 | Paper |
A hypergraph Turán theorem via Lagrangians of intersecting families | 2014-06-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q5419956 | 2014-06-11 | Paper |
Dynamic concentration of the triangle-free process | 2014-06-11 | Paper |
On a conjecture of Erdős and Simonovits: even cycles | 2014-03-17 | Paper |
A hypergraph Turán theorem via Lagrangians of intersecting families | 2014-01-06 | Paper |
Digraph Girth via Chromatic Number | 2013-09-26 | Paper |
Finding Hamilton cycles in robustly expanding digraphs | 2012-12-04 | Paper |
The Turán Number ofF3,3 | 2012-06-04 | Paper |
A hypergraph blow-up lemma | 2011-10-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q3089368 | 2011-08-24 | Paper |
A Semiexact Degree Condition for Hamilton Cycles in Digraphs | 2011-06-17 | Paper |
Bounded direction-length frameworks | 2011-06-10 | Paper |
Necessary conditions for the global rigidity of direction-length frameworks | 2011-06-10 | Paper |
Set systems without a simplex or a cluster | 2011-04-26 | Paper |
Loose Hamilton cycles in hypergraphs | 2011-03-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q3576652 | 2010-07-30 | Paper |
The early evolution of the \(H\)-free process | 2010-07-06 | Paper |
Pancyclicity of Hamiltonian and highly connected graphs | 2010-06-03 | Paper |
Directed Graphs Without Short Cycles | 2010-04-23 | Paper |
Triangle packings and 1-factors in oriented graphs | 2009-06-23 | Paper |
A hypergraph regularity method for generalized Turán problems | 2009-03-04 | Paper |
An exact minimum degree condition for Hamilton cycles in oriented graphs | 2009-02-06 | Paper |
Shadows and intersections: Stability and new proofs | 2008-07-10 | Paper |
Set Systems with No Singleton Intersection | 2007-11-16 | Paper |
Codegree problems for projective geometries | 2007-10-10 | Paper |
Rainbow Turán Problems | 2007-03-20 | Paper |
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs | 2007-01-16 | Paper |
On a restricted cross-intersection problem | 2006-12-07 | Paper |
A random construction for permutation codes and the covering radius | 2006-11-22 | Paper |
Pairwise intersections and forbidden configurations | 2006-11-15 | Paper |
Bounding the number of edges in permutation graphs | 2006-08-30 | Paper |
Sparse halves in triangle-free graphs | 2006-07-12 | Paper |
The Turán number of the Fano plane | 2006-06-27 | Paper |
On a hypergraph Turán problem of Frankl | 2006-06-27 | Paper |
The Turán problem for hypergraphs on fixed size | 2005-11-01 | Paper |
Disjoint representability of sets and their complements | 2005-09-28 | Paper |
The Turán problem for projective geometries | 2005-09-28 | Paper |
Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices | 2005-09-16 | Paper |
THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES | 2005-03-14 | Paper |
Packing triangles in a graph and its complement | 2005-02-16 | Paper |
Multicolour Turán problems | 2004-10-12 | Paper |
Stability theorems for cancellative hypergraphs | 2004-10-01 | Paper |
Multicoloured extremal problems | 2004-10-01 | Paper |
The characteristic polynomial of a random permutation matrix. | 2004-09-22 | Paper |
On the number of edges not covered by monochromatic copies of a fixed graph. | 2004-03-15 | Paper |
Local Density in Graphs with Forbidden Subgraphs | 2003-09-24 | Paper |