2022
The generalised Oberwolfach problem.
J. Comb. Theory, Ser. B, 2022
Finding matchings in dense hypergraphs.
CoRR, 2022
2021
Dynamic concentration of the triangle-free process.
Random Struct. Algorithms, 2021
2020
Algorithms for #BIS-Hard Problems on Expander Graphs.
SIAM J. Comput., 2020
Stability for vertex isoperimetry in the cube.
J. Comb. Theory, Ser. B, 2020
Global rigidity of direction-length frameworks.
J. Comb. Theory, Ser. B, 2020
Rainbow factors in hypergraphs.
J. Comb. Theory, Ser. A, 2020
On the number of symbols that forces a transversal.
Comb. Probab. Comput., 2020
Finding Perfect Matchings in Dense Hypergraphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
2018
Rainbow Matchings in Properly Colored Multigraphs.
SIAM J. Discret. Math., 2018
A stability result for the cube edge isoperimetric inequality.
J. Comb. Theory, Ser. A, 2018
2017
Equiangular lines and subspaces in Euclidean spaces.
Electron. Notes Discret. Math., 2017
The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours.
Comb. Probab. Comput., 2017
Rainbow matchings in properly-coloured multigraphs.
CoRR, 2017
2016
On the Normalized Shannon Capacity of a Union.
Comb. Probab. Comput., 2016
2015
A multipartite Hajnal-Szemerédi theorem.
J. Comb. Theory, Ser. B, 2015
2014
Spectral Extremal Problems for Hypergraphs.
SIAM J. Discret. Math., 2014
Turán numbers of bipartite graphs plus an odd cycle.
J. Comb. Theory, Ser. B, 2014
Frankl-Rödl type theorems for codes and permutations.
CoRR, 2014
2013
Digraph Girth via Chromatic Number.
SIAM J. Discret. Math., 2013
A hypergraph Turán theorem via lagrangians of intersecting families.
J. Comb. Theory, Ser. A, 2013
An Approximate Vertex-Isoperimetric Inequality for r-sets.
Electron. J. Comb., 2013
On a conjecture of Erdős and Simonovits: Even cycles.
Comb., 2013
Polynomial-time perfect matchings in dense hypergraphs.
Proceedings of the Symposium on Theory of Computing Conference, 2013
2012
Finding Hamilton cycles in robustly expanding digraphs.
J. Graph Algorithms Appl., 2012
The Turán Number of <i>F</i><sub>3, 3</sub>.
Comb. Probab. Comput., 2012
2011
A hypergraph blow-up lemma.
Random Struct. Algorithms, 2011
Loose Hamilton cycles in hypergraphs.
Discret. Math., 2011
Necessary Conditions for the Global Rigidity of Direction-Length Frameworks.
Discret. Comput. Geom., 2011
Bounded Direction-Length Frameworks.
Discret. Comput. Geom., 2011
2010
A Semiexact Degree Condition for Hamilton Cycles in Digraphs.
SIAM J. Discret. Math., 2010
Pancyclicity of Hamiltonian and highly connected graphs.
J. Comb. Theory, Ser. B, 2010
Directed Graphs Without Short Cycles.
Comb. Probab. Comput., 2010
Set systems without a simplex or a cluster.
Comb., 2010
2009
A hypergraph regularity method for generalized Turán problems.
Random Struct. Algorithms, 2009
Triangle packings and 1-factors in oriented graphs.
J. Comb. Theory, Ser. B, 2009
2007
Codegree problems for projective geometries.
J. Comb. Theory, Ser. B, 2007
Comb. Probab. Comput., 2007
2006
Set Systems with No Singleton Intersection.
SIAM J. Discret. Math., 2006
Sparse halves in triangle-free graphs.
J. Comb. Theory, Ser. B, 2006
On a restricted cross-intersection problem.
J. Comb. Theory, Ser. A, 2006
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs.
J. Comb. Theory, Ser. B, 2006
Pairwise intersections and forbidden configurations.
Eur. J. Comb., 2006
A random construction for permutation codes and the covering radius.
Des. Codes Cryptogr., 2006
Bounding the Number of Edges in Permutation Graphs.
Electron. J. Comb., 2006
2005
Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices.
SIAM J. Discret. Math., 2005
The Turán problem for projective geometries.
J. Comb. Theory, Ser. A, 2005
Disjoint representability of sets and their complements.
J. Comb. Theory, Ser. B, 2005
The Turán Problem for Hypergraphs of Fixed Size.
Electron. J. Comb., 2005
On A Hypergraph Turán Problem Of Frankl.
Comb., 2005
The Turán Number Of The Fano Plane.
Comb., 2005
2004
Packing triangles in a graph and its complement.
J. Graph Theory, 2004
On the number of edges not covered by monochromatic copies of a fixed graph.
J. Comb. Theory, Ser. B, 2004
Stability theorems for cancellative hypergraphs.
J. Comb. Theory, Ser. B, 2004
Multicoloured extremal problems.
J. Comb. Theory, Ser. A, 2004
Multicolour Turán problems.
Adv. Appl. Math., 2004
2003
Local Density In Graphs With Forbidden Subgraphs.
Comb. Probab. Comput., 2003
