| The maximum size of hypergraphs without generalized 4-cycles Oleg Pikhurko, Jacques Verstraete. Submitted to Journal of Combinatorial Theory Series B. |
| Two regular subgraphs of hypergraphs Dhruv Mubayi, Jacques Verstraete. |
| Dissemination thresholds in regular and irregular graph classes Ivan Rapaport, Karol Suchan, Ioan Todinka, Jacques Verstraete. |
| Cycles in sparse graphs
Benny Sudakov, Jacques Verstraete. To appear in Combinatorica. |
| On the threshold for k-regular subgraphs of random graphs Pawel Pralat, Jacques Verstraete, Nick Wormald. Submitted to Combinatorica. |
| Minimal Paths and Cycles in Set Systems
Dhruv Mubayi, Jacques Verstraete. To appear in European Journal of Combinatorics. |
| A note on f-factors and polynomials Hamed Shirazi, Jacques Verstraete. Unpublished. |
| Clique partitions of dense graphs Mike Cavers, Jacques Verstraete. To appear in Discrete Mathematics. |
| Rainbow Turan Problems Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraete. Combinatorics, Probability and Computing, to appear. |
Independent dominating sets and hamiltonian cycles Jacques Verstraete, Penny Haxell and Ben Seamone. To appear in Journal of Graph Theory. |
| Cycles in planar graphs Jacques Verstraete. Special Issue of Utilitas Mathematica in honour of Professor Henda Swart, to appear. |
| Product representations of polynomials Jacques Verstraete. To appear in a Special Issue of European Journal of Combinatorics. |
| Parity check matrices and
product representation of squares Assaf Naor, Jacques Verstraete, Proceedings IEEE ISIT Conference, Adelaide, Australia. Submitted to Combinatorica. |
| Approximation algorithms and hardness results for cycle packing problems (formerly Disjoint Cycles : Integrality Gap, Hardness and Approximation) Zeev Nutov, Mohammad Salavatipour, Jacques Verstraete, Raphael Yuster Proceedings IPCO X Berlin, Germany. Submitted to ACM Transactions on Algorithms. |
| A note on graphs without short even cycles Thomas Lam, Jacques Verstraete. Electron. J. Combin. 12 (2005), Note 5, 6 pp. (electronic). |
| On the Turan number for the hexagon Assaf Naor, Zoltan Furedi, Jacques Verstraete. Advances in Mathematics, 203(2), 476-496 (2006). |
| A note on bipartite graphs without 2k-cycles Assaf Naor, Jacques Verstraete. Combin. Probab. Comput. 14 (2005), no. 5-6, 845--849. |
|
On the number of sets of cycle lengths Jacques Verstraete. Combinatorica 24 (2004), no. 4, 719--730. |
| Unavoidable cycle lengths in graphs Jacques Verstraete. J. Graph Theory 49 (2005), no. 2, 151--167. |
| Even cycles in hypergraphs Kostochka, Alexandr, Jacques Verstraete. J. Combin. Theory Ser. B 94 (2005), no. 1, 173--182. |
| Regular Subgraphs of Random Graphs with Jeong Han Kim and Bela Bollobas. Random Structures and Algorithms, Volume 29, Issue 1, Pages 1-13. (2006)
|
| Multicolor Turán problems Peter Keevash, Mike Saks, Benny Sudakov, Jacques Verstraete. Advances in Applied Mathematics 33 (2004), 238--262. |
| On hypergraphs of girth five Felix Lazebnik, Jacques Verstraete. Electron. J. Combin. 10 (2003), Research Paper 25, 15 pp. (electronic). |
| Proof of a conjecture of Erdos on triangles in set-systems Dhruv Mubayi, Jacques Verstraete. Combinatorica 25 (2005), no. 5, 599--614. |
|
A hypergraph extension of the bipartite Turán problem Dhruv Mubayi, Verstraete, J. J. Combin. Theory Ser. A 106 (2004), no. 2, 237--253. |
|
A note on vertex-disjoint cycles Jacques Verstraete. Combin. Probab. Comput. 11 (2002), no. 1, 97--102. |
| Disjoint subgraphs of graphs Unpublished article. Currently being revised. |
| Vertex-disjoint cycles of the same length Jacques Verstraete. J. Combin. Theory Ser. B 88 (2003), no. 1, 45--52. |
| On arithmetic progressions of cycle lengths in graphs Jacques Verstraete. Combin. Probab. Comput. 9 (2000), no. 4, 369--373. |