According to our database
1,
Jacques Verstraëte
authored at least 72 papers
between 2000 and 2023.
Collaborative distances:
2023
Extremal Problems for Hypergraph Blowups of Trees.
SIAM J. Discret. Math., December, 2023
Hypergraph Ramsey numbers of cliques versus stars.
Random Struct. Algorithms, October, 2023
2022
Ramsey Numbers for Nontrivial Berge Cycles.
SIAM J. Discret. Math., 2022
Counting hypergraphs with large girth.
J. Graph Theory, 2022
Extremal problems for pairs of triangles.
J. Comb. Theory, Ser. B, 2022
A Note on k-Wise Oddtown Problems.
Graphs Comb., 2022
On asymptotic packing of geometric graphs.
Discret. Appl. Math., 2022
2021
Relative Turán Problems for Uniform Hypergraphs.
SIAM J. Discret. Math., 2021
Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth.
Random Struct. Algorithms, 2021
Non-trivial <i>d</i>-wise intersecting families.
J. Comb. Theory, Ser. A, 2021
Partitioning ordered hypergraphs.
J. Comb. Theory, Ser. A, 2021
Triangle-Free Subgraphs of Hypergraphs.
Graphs Comb., 2021
Relative Turán numbers for hypergraph cycles.
Discret. Math., 2021
Independent dominating sets in graphs of girth five.
Comb. Probab. Comput., 2021
A Generalization of the Bollobás Set Pairs Inequality.
Electron. J. Comb., 2021
2020
Ordered and Convex Geometric Trees with Linear Extremal Function.
Discret. Comput. Geom., 2020
Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2.
Discret. Appl. Math., 2020
2019
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk.
SIAM J. Discret. Math., 2019
Graphs without theta subgraphs.
J. Comb. Theory, Ser. B, 2019
A note on Pseudorandom Ramsey graphs.
CoRR, 2019
2018
Stability in the Erdős-Gallai Theorem on cycles and paths, II.
Discret. Math., 2018
2017
Turán problems and shadows II: Trees.
J. Comb. Theory, Ser. B, 2017
The Extremal Function for Cycles of Length l mod k.
Electron. J. Comb., 2017
Cycles in triangle-free graphs of large chromatic number.
Comb., 2017
2016
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.
Electron. J. Comb., 2016
2015
Turán Problems and Shadows III: Expansions of Graphs.
SIAM J. Discret. 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.
Discret. Math., 2015
On coupon colorings of graphs.
Discret. Appl. Math., 2015
2014
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
2013
Hypergraph Ramsey numbers: Triangles versus cliques.
J. Comb. Theory, Ser. A, 2013
On the Independence Number of Steiner Systems.
Comb. Probab. Comput., 2013
Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Permutation Codes.
CoRR, 2013
On a conjecture of Erdős and Simonovits: Even cycles.
Comb., 2013
2012
The de Bruijn-Erdős theorem for hypergraphs.
Des. Codes Cryptogr., 2012
On Even-Degree Subgraphs of Linear Hypergraphs.
Comb. Probab. Comput., 2012
Large Incidence-free Sets in Geometries.
Electron. J. Comb., 2012
2011
On the threshold for k-regular subgraphs of random graphs.
Comb., 2011
On Dissemination Thresholds in Regular and Irregular Graph Classes.
Algorithmica, 2011
2010
List Coloring Hypergraphs.
Electron. J. Comb., 2010
2009
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
2008
Clique partitions of complements of forests and bounded degree graphs.
Discret. Math., 2008
An Extremal Characterization of Projective Planes.
Electron. J. Comb., 2008
A Note on Polynomials and f-Factors of Graphs.
Electron. J. Comb., 2008
Cycle lengths in sparse graphs.
Comb., 2008
Parity check matrices and product representations of squares.
Comb., 2008
2007
Approximation algorithms and hardness results for cycle packing problems.
ACM Trans. Algorithms, 2007
Independent dominating sets and hamiltonian cycles.
J. Graph Theory, 2007
Minimal paths and cycles in set systems.
Eur. J. Comb., 2007
Comb. Probab. Comput., 2007
2006
Regular subgraphs of random graphs.
Random Struct. Algorithms, 2006
Product representations of polynomials.
Eur. J. Comb., 2006
2005
Unavoidable cycle lengths in graphs.
J. Graph Theory, 2005
Even cycles in hypergraphs.
J. Comb. Theory, Ser. B, 2005
A Note on Graphs Without Short Even Cycles.
Electron. J. Comb., 2005
Proof Of A Conjecture Of Erdös On Triangles In Set-Systems.
Comb., 2005
Improved bounds on the size of sparse parity check matrices.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
Disjoint Cycles: Integrality Gap, Hardness, and Approximation.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005
2004
A hypergraph extension of the bipartite Turán problem.
J. Comb. Theory, Ser. A, 2004
On The Number Of Sets Of Cycle Lengths.
Comb., 2004
Multicolour Turán problems.
Adv. Appl. Math., 2004
2003
Vertex-disjoint cycles of the same length.
J. Comb. Theory, Ser. B, 2003
On Hypergraphs of Girth Five.
Electron. J. Comb., 2003
2002
A Note On Vertex-Disjoint Cycles.
Comb. Probab. Comput., 2002
2000
On Arithmetic Progressions Of Cycle Lengths In Graphs.
Comb. Probab. Comput., 2000
