On Arithmetic Progressions Of Cycle Lengths In Graphs. - Jacques Verstraëte (Comb. Probab. Comput., 2000)

A Note On Vertex-Disjoint Cycles. - Jacques Verstraëte (Comb. Probab. Comput., 2002)

On Hypergraphs of Girth Five. - Felix Lazebnik; Jacques Verstraëte (Electron. J. Comb., 2003)

Vertex-disjoint cycles of the same length. - Jacques Verstraëte (J. Comb. Theory B, 2003)

Multicolour Turán problems. - Peter Keevash; Michael E. Saks; Benny Sudakov; Jacques Verstraëte (Adv. Appl. Math., 2004)

On The Number Of Sets Of Cycle Lengths. - Jacques Verstraëte (Comb., 2004)

A hypergraph extension of the bipartite Turán problem. - Dhruv Mubayi; Jacques Verstraëte (J. Comb. Theory A, 2004)

Disjoint Cycles: Integrality Gap, Hardness, and Approximation. - Mohammad R. Salavatipour; Jacques Verstraëte (IPCO, 2005)

Improved bounds on the size of sparse parity check matrices. - Assaf Naor; Jacques Verstraëte (ISIT, 2005)

Proof Of A Conjecture Of Erdös On Triangles In Set-Systems. - Dhruv Mubayi; Jacques Verstraëte (Comb., 2005)

A Note on Graphs Without Short Even Cycles. - Thomas Lam; Jacques Verstraëte (Electron. J. Comb., 2005)

Even cycles in hypergraphs. - Alexandr V. Kostochka; Jacques Verstraëte (J. Comb. Theory B, 2005)

Unavoidable cycle lengths in graphs. - Jacques Verstraëte (J. Graph Theory, 2005)

Product representations of polynomials. - Jacques Verstraëte (Eur. J. Comb., 2006)

Regular subgraphs of random graphs. - Béla Bollobás; Jeong Han Kim; Jacques Verstraëte (Random Struct. Algorithms, 2006)

Rainbow Turán Problems. - Peter Keevash; Dhruv Mubayi; Benny Sudakov; Jacques Verstraëte (Comb. Probab. Comput., 2007)

Minimal paths and cycles in set systems. - Dhruv Mubayi; Jacques Verstraëte (Eur. J. Comb., 2007)

Independent dominating sets and hamiltonian cycles. - Penny E. Haxell; Ben Seamone; Jacques Verstraëte (J. Graph Theory, 2007)

Approximation algorithms and hardness results for cycle packing problems. - Michael Krivelevich; Zeev Nutov; Mohammad R. Salavatipour; Jacques Verstraëte; Raphael Yuster (ACM Trans. Algorithms, 2007)

Parity check matrices and product representations of squares. - Assaf Naor; Jacques Verstraëte (Comb., 2008)

Cycle lengths in sparse graphs. - Benny Sudakov; Jacques Verstraëte (Comb., 2008)

A Note on Polynomials and f-Factors of Graphs. - Hamed Shirazi; Jacques Verstraëte (Electron. J. Comb., 2008)

An Extremal Characterization of Projective Planes. - Stefaan De Winter; Felix Lazebnik; Jacques Verstraëte (Electron. J. Comb., 2008)

Clique partitions of complements of forests and bounded degree graphs. - Michael Cavers; Jacques Verstraëte (Discret. Math., 2008)

On decompositions of complete hypergraphs. - Sebastian M. Cioaba; André Kündgen; Jacques Verstraëte (J. Comb. Theory A, 2009)

Two-regular subgraphs of hypergraphs. - Dhruv Mubayi; Jacques Verstraëte (J. Comb. Theory B, 2009)

The maximum size of hypergraphs without generalized 4-cycles. - Oleg Pikhurko; Jacques Verstraëte (J. Comb. Theory A, 2009)

List Coloring Hypergraphs. - Penny E. Haxell; Jacques Verstraëte (Electron. J. Comb., 2010)

On Dissemination Thresholds in Regular and Irregular Graph Classes. - Ivan Rapaport; Karol Suchan; Ioan Todinca; Jacques Verstraëte (Algorithmica, 2011)

On the threshold for k-regular subgraphs of random graphs. - Pawel Pralat; Jacques Verstraëte; Nicholas C. Wormald (Comb., 2011)

Large Incidence-free Sets in Geometries. - Stefaan De Winter; Jeroen Schillewaert; Jacques Verstraëte (Electron. J. Comb., 2012)

On Even-Degree Subgraphs of Linear Hypergraphs. - Domingos Dellamonica Jr.; Penny E. Haxell; Tomasz Luczak 001; Dhruv Mubayi; Brendan Nagle; Yury Person; Vojtech Rödl; Mathias Schacht; Jacques Verstraëte (Comb. Probab. Comput., 2012)

The de Bruijn-Erdős theorem for hypergraphs. - Noga Alon; Keith E. Mellinger; Dhruv Mubayi; Jacques Verstraëte (Des. Codes Cryptogr., 2012)

On a conjecture of Erdős and Simonovits: Even cycles. - Peter Keevash; Benny Sudakov; Jacques Verstraëte (Comb., 2013)

Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Permutation Codes. - Michael Tait; Alexander Vardy; Jacques Verstraëte (CoRR, 2013)

On the Independence Number of Steiner Systems. - Alex Eustis; Jacques Verstraëte (Comb. Probab. Comput., 2013)

Hypergraph Ramsey numbers: Triangles versus cliques. - Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (J. Comb. Theory A, 2013)

Turán numbers of bipartite graphs plus an odd cycle. - Peter Allen 001; Peter Keevash; Benny Sudakov; Jacques Verstraëte (J. Comb. Theory B, 2014)

On independent sets in hypergraphs. - Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (Random Struct. Algorithms, 2014)

On coupon colorings of graphs. - Bob Chen; Jeong Han Kim; Michael Tait; Jacques Verstraëte (Discret. Appl. Math., 2015)

Probabilistic constructions in generalized quadrangles. - Jeroen Schillewaert; Jacques Verstraëte (Discret. Math., 2015)

A counterexample to sparse removal. - Craig Timmons; Jacques Verstraëte (Eur. J. Comb., 2015)

Turán problems and shadows I: Paths and cycles. - Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (J. Comb. Theory A, 2015)

Turán Problems and Shadows III: Expansions of Graphs. - Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (SIAM J. Discret. Math., 2015)

Counting Trees in Graphs. - Jacques Verstraëte; Dhruv Mubayi (Electron. J. Comb., 2016)

On sets of integers with restrictions on their products. - Michael Tait; Jacques Verstraëte (Eur. J. Comb., 2016)

Stability in the Erdős-Gallai Theorems on cycles and paths. - Zoltán Füredi; Alexandr V. Kostochka; Jacques Verstraëte (J. Comb. Theory B, 2016)

Cycles in triangle-free graphs of large chromatic number. - Alexandr V. Kostochka; Benny Sudakov; Jacques Verstraëte (Comb., 2017)

The Extremal Function for Cycles of Length l mod k. - Benny Sudakov; Jacques Verstraëte (Electron. J. Comb., 2017)

Turán problems and shadows II: Trees. - Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (J. Comb. Theory B, 2017)

Stability in the Erdős-Gallai Theorem on cycles and paths, II. - Zoltán Füredi; Alexandr V. Kostochka; Ruth Luo; Jacques Verstraëte (Discret. Math., 2018)

Full subgraphs. - Victor Falgas-Ravry; Klas Markström; Jacques Verstraëte (J. Graph Theory, 2018)

A note on Pseudorandom Ramsey graphs. - Dhruv Mubayi; Jacques Verstraëte (CoRR, 2019)

Graphs without theta subgraphs. - Jacques Verstraëte; Jason Williford (J. Comb. Theory B, 2019)

Hypergraphs Not Containing a Tight Tree with a Bounded Trunk. - Zoltán Füredi; Tao Jiang 003; Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (SIAM J. Discret. Math., 2019)

Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2. - Zoltán Füredi; Tao Jiang 003; Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (Discret. Appl. Math., 2020)

Ordered and Convex Geometric Trees with Linear Extremal Function. - Zoltán Füredi; Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (Discret. Comput. Geom., 2020)

A Generalization of the Bollobás Set Pairs Inequality. - Jason O'Neill; Jacques Verstraëte (Electron. J. Comb., 2021)

Independent dominating sets in graphs of girth five. - Ararat Harutyunyan; Paul Horn; Jacques Verstraëte (Comb. Probab. Comput., 2021)

Relative Turán numbers for hypergraph cycles. - Sam Spiro; Jacques Verstraëte (Discret. Math., 2021)

Triangle-Free Subgraphs of Hypergraphs. - Jiaxi Nie; Sam Spiro; Jacques Verstraëte (Graphs Comb., 2021)

Partitioning ordered hypergraphs. - Zoltán Füredi; Tao Jiang 003; Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (J. Comb. Theory A, 2021)

Non-trivial d-wise intersecting families. - Jason O'Neill; Jacques Verstraëte (J. Comb. Theory A, 2021)

Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth. - Jiaxi Nie; Jacques Verstraëte (Random Struct. Algorithms, 2021)

Relative Turán Problems for Uniform Hypergraphs. - Sam Spiro; Jacques Verstraëte (SIAM J. Discret. Math., 2021)

On asymptotic packing of geometric graphs. - Daniel W. Cranston; Jiaxi Nie; Jacques Verstraëte; Alexandra Wesolek (Discret. Appl. Math., 2022)

A Note on k-Wise Oddtown Problems. - Jason O'Neill; Jacques Verstraëte (Graphs Comb., 2022)

Extremal problems for pairs of triangles. - Zoltán Füredi; Dhruv Mubayi; Jason O'Neill; Jacques Verstraëte (J. Comb. Theory B, 2022)

Counting hypergraphs with large girth. - Sam Spiro; Jacques Verstraëte (J. Graph Theory, 2022)

Ramsey Numbers for Nontrivial Berge Cycles. - Jiaxi Nie; Jacques Verstraëte (SIAM J. Discret. Math., 2022)

Hypergraph Ramsey numbers of cliques versus stars. - David Conlon; Jacob Fox; Xiaoyu He; Dhruv Mubayi; Andrew Suk; Jacques Verstraëte (Random Struct. Algorithms, 2023)

Extremal Problems for Hypergraph Blowups of Trees. - Zoltán Füredi; Tao Jiang 003; Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (SIAM J. Discret. Math., 2023)