2023
Canonical colourings in random graphs.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
2022
Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs.
SIAM J. Discret. Math., 2022
2021
High powers of Hamiltonian cycles in randomly augmented graphs.
J. Graph Theory, 2021
On the size-Ramsey number of grid graphs.
Comb. Probab. Comput., 2021
Finding tight Hamilton cycles in random hypergraphs faster.
Comb. Probab. Comput., 2021
Hamiltonian Berge cycles in random hypergraphs.
Comb. Probab. Comput., 2021
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
2020
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs.
Random Struct. Algorithms, 2020
Embedding spanning subgraphs in uniformly dense and inseparable graphs.
Random Struct. Algorithms, 2020
Powers of Hamiltonian cycles in randomly augmented graphs.
Random Struct. Algorithms, 2020
On the structure of Dense graphs with bounded clique number.
Comb. Probab. Comput., 2020
Homomorphism Thresholds for Odd Cycles.
Comb., 2020
2018
Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs.
Random Struct. Algorithms, 2018
An algorithmic hypergraph regularity lemma.
Random Struct. Algorithms, 2018
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs.
J. Lond. Math. Soc., 2018
2017
Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version.
SIAM J. Discret. Math., 2017
Monochromatic trees in random graphs.
Electron. Notes Discret. Math., 2017
On the local density problem for graphs of given odd-girth.
Electron. Notes Discret. Math., 2017
Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version.
Electron. Notes Discret. Math., 2017
Quasirandomness in hypergraphs.
Electron. Notes Discret. Math., 2017
Counting results for sparse pseudorandom hypergraphs II.
Eur. J. Comb., 2017
Counting results for sparse pseudorandom hypergraphs I.
Eur. J. Comb., 2017
Ramsey properties of random graphs and Folkman numbers.
Discuss. Math. Graph Theory, 2017
An exponential-type upper bound for Folkman numbers.
Comb., 2017
2016
Embedding tetrahedra into quasirandom hypergraphs.
J. Comb. Theory, Ser. B, 2016
Packing minor-closed families of graphs into complete graphs.
J. Comb. Theory, Ser. B, 2016
Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version.
Electron. Notes Discret. Math., 2016
2015
On the Structure of Graphs with Given Odd Girth and Large Minimum Degree.
J. Graph Theory, 2015
Packing minor closed families of graphs.
Electron. Notes Discret. Math., 2015
A counting lemma for sparse pseudorandom hypergraphs.
Electron. Notes Discret. Math., 2015
Ramsey-type numbers involving graphs and hypergraphs with large girth.
Electron. Notes Discret. Math., 2015
Ramsey numbers for bipartite graphs with small bandwidth.
Eur. J. Comb., 2015
2014
Upper bounds on probability thresholds for asymmetric Ramsey properties.
Random Struct. Algorithms, 2014
2013
Extremal results for odd cycles in sparse pseudorandom graphs.
Electron. Notes Discret. Math., 2013
2012
Complete Partite subgraphs in dense hypergraphs.
Random Struct. Algorithms, 2012
Weak quasi-randomness for uniform hypergraphs.
Random Struct. Algorithms, 2012
On Even-Degree Subgraphs of Linear Hypergraphs.
Comb. Probab. Comput., 2012
2011
Electron. Notes Discret. Math., 2011
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs.
Electron. Notes Discret. Math., 2011
Untangling planar graphs from a specified vertex position - Hard cases.
Discret. Appl. Math., 2011
2010
Regular partitions of hypergraphs and property testing
PhD thesis, 2010
Note on Bipartite Graph Tilings.
SIAM J. Discret. Math., 2010
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions.
SIAM J. Comput., 2010
Ramsey properties of random discrete structures.
Random Struct. Algorithms, 2010
Weak hypergraph regularity and linear hypergraphs.
J. Comb. Theory, Ser. B, 2010
Dirac-type results for loose Hamilton cycles in uniform hypergraphs.
J. Comb. Theory, Ser. B, 2010
2009
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree.
SIAM J. Discret. Math., 2009
An expected polynomial time algorithm for coloring 2-colorable 3-graphs.
Electron. Notes Discret. Math., 2009
Note on strong refutation algorithms for random k-SAT formulas.
Electron. Notes Discret. Math., 2009
On Colourings of Hypergraphs Without Monochromatic Fano Planes.
Comb. Probab. Comput., 2009
Generalizations of the removal lemma.
Comb., 2009
Almost all hypergraphs without Fano planes are bipartite.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Hypergraph regularity and quasi-randomness.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
2008
Spanning 3-colourable subgraphs of small bandwidth in dense graphs.
J. Comb. Theory, Ser. B, 2008
On the Ramsey Number of Sparse 3-Graphs.
Graphs Comb., 2008
Note on the 3-graph counting lemma.
Discret. Math., 2008
Obfuscated Drawings of Planar Graphs
CoRR, 2008
2007
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs.
SIAM J. Discret. Math., 2007
Integer and fractional packings of hypergraphs.
J. Comb. Theory, Ser. B, 2007
Turán's theorem for pseudo-random graphs.
J. Comb. Theory, Ser. A, 2007
Embedding spanning subgraphs of small bandwidth.
Electron. Notes Discret. Math., 2007
Regular Partitions of Hypergraphs: Counting Lemmas.
Comb. Probab. Comput., 2007
Regular Partitions of Hypergraphs: Regularity Lemmas.
Comb. Probab. Comput., 2007
Property testing in hypergraphs and the removal lemma.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
On the bandwidth conjecture for 3-colourable graphs.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
2006
The counting lemma for regular <i>k</i>-uniform hypergraphs.
Random Struct. Algorithms, 2006
2005
Globally bounded local edge colourings of hypergraphs.
Electron. Notes Discret. Math., 2005
Every Monotone 3-Graph Property is Testable.
Electron. Notes Discret. Math., 2005
2004
The Turán Theorem for Random Graphs.
Comb. Probab. Comput., 2004
