Jacques Verstraëte

According to our database1, Jacques Verstraëte authored at least 48 papers between 2000 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 



On csauthors.net:


Graphs without theta subgraphs.
J. Comb. Theory, Ser. B, 2019

Stability in the Erdős-Gallai Theorem on cycles and paths, II.
Discrete Mathematics, 2018

Turán problems and shadows II: Trees.
J. Comb. Theory, Ser. B, 2017

The Extremal Function for Cycles of Length l mod k.
Electr. J. Comb., 2017

Cycles in triangle-free graphs of large chromatic number.
Combinatorica, 2017

Stability in the Erdős-Gallai Theorems on cycles and paths.
J. Comb. Theory, Ser. B, 2016

On sets of integers with restrictions on their products.
Eur. J. Comb., 2016

Counting Trees in Graphs.
Electr. J. Comb., 2016

Turán Problems and Shadows III: Expansions of Graphs.
SIAM J. Discrete Math., 2015

Turán problems and shadows I: Paths and cycles.
J. Comb. Theory, Ser. A, 2015

A counterexample to sparse removal.
Eur. J. Comb., 2015

Probabilistic constructions in generalized quadrangles.
Discrete Mathematics, 2015

On coupon colorings of graphs.
Discrete Applied Mathematics, 2015

On independent sets in hypergraphs.
Random Struct. Algorithms, 2014

Turán numbers of bipartite graphs plus an odd cycle.
J. Comb. Theory, Ser. B, 2014

Hypergraph Ramsey numbers: Triangles versus cliques.
J. Comb. Theory, Ser. A, 2013

On the Independence Number of Steiner Systems.
Combinatorics, Probability & Computing, 2013

On a conjecture of Erdős and Simonovits: Even cycles.
Combinatorica, 2013

The de Bruijn-Erdős theorem for hypergraphs.
Des. Codes Cryptography, 2012

On Even-Degree Subgraphs of Linear Hypergraphs.
Combinatorics, Probability & Computing, 2012

Large Incidence-free Sets in Geometries.
Electr. J. Comb., 2012

On the threshold for k-regular subgraphs of random graphs.
Combinatorica, 2011

List Coloring Hypergraphs.
Electr. J. Comb., 2010

The maximum size of hypergraphs without generalized 4-cycles.
J. Comb. Theory, Ser. A, 2009

Two-regular subgraphs of hypergraphs.
J. Comb. Theory, Ser. B, 2009

On decompositions of complete hypergraphs.
J. Comb. Theory, Ser. A, 2009

Clique partitions of complements of forests and bounded degree graphs.
Discrete Mathematics, 2008

An Extremal Characterization of Projective Planes.
Electr. J. Comb., 2008

A Note on Polynomials and f-Factors of Graphs.
Electr. J. Comb., 2008

Cycle lengths in sparse graphs.
Combinatorica, 2008

Parity check matrices and product representations of squares.
Combinatorica, 2008

On Dissemination Thresholds in Regular and Irregular Graph Classes.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Independent dominating sets and hamiltonian cycles.
Journal of Graph Theory, 2007

Minimal paths and cycles in set systems.
Eur. J. Comb., 2007

Rainbow Turán Problems.
Combinatorics, Probability & Computing, 2007

Regular subgraphs of random graphs.
Random Struct. Algorithms, 2006

Product representations of polynomials.
Eur. J. Comb., 2006

Unavoidable cycle lengths in graphs.
Journal of Graph Theory, 2005

Even cycles in hypergraphs.
J. Comb. Theory, Ser. B, 2005

A Note on Graphs Without Short Even Cycles.
Electr. J. Comb., 2005

Proof Of A Conjecture Of Erdös On Triangles In Set-Systems.
Combinatorica, 2005

Disjoint Cycles: Integrality Gap, Hardness, and Approximation.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

A hypergraph extension of the bipartite Turán problem.
J. Comb. Theory, Ser. A, 2004

On The Number Of Sets Of Cycle Lengths.
Combinatorica, 2004

Vertex-disjoint cycles of the same length.
J. Comb. Theory, Ser. B, 2003

On Hypergraphs of Girth Five.
Electr. J. Comb., 2003

A Note On Vertex-Disjoint Cycles.
Combinatorics, Probability & Computing, 2002

On Arithmetic Progressions Of Cycle Lengths In Graphs.
Combinatorics, Probability & Computing, 2000