default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacques Verstraëte
Person information
- affiliation: University of California, San Diego, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j68]David Conlon, Jacob Fox, Xiaoyu He
, Dhruv Mubayi, Andrew Suk, Jacques Verstraëte:
Hypergraph Ramsey numbers of cliques versus stars. Random Struct. Algorithms 63(3): 610-623 (2023)- [j67]Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Extremal Problems for Hypergraph Blowups of Trees. SIAM J. Discret. Math. 37(4): 2397-2416 (2023) - 2022
- [j66]Daniel W. Cranston, Jiaxi Nie, Jacques Verstraëte, Alexandra Wesolek:
On asymptotic packing of geometric graphs. Discret. Appl. Math. 322: 142-152 (2022) - [j65]Jason O'Neill, Jacques Verstraëte:
A Note on k-Wise Oddtown Problems. Graphs Comb. 38(3): 101 (2022) - [j64]Zoltán Füredi, Dhruv Mubayi, Jason O'Neill, Jacques Verstraëte:
Extremal problems for pairs of triangles. J. Comb. Theory B 155: 83-110 (2022) - [j63]Sam Spiro, Jacques Verstraëte:
Counting hypergraphs with large girth. J. Graph Theory 100(3): 543-558 (2022) - [j62]Jiaxi Nie, Jacques Verstraëte:
Ramsey Numbers for Nontrivial Berge Cycles. SIAM J. Discret. Math. 36(1): 103-113 (2022) - 2021
- [j61]Jason O'Neill, Jacques Verstraëte:
A Generalization of the Bollobás Set Pairs Inequality. Electron. J. Comb. 28(3): 3 (2021) - [j60]Ararat Harutyunyan, Paul Horn, Jacques Verstraëte:
Independent dominating sets in graphs of girth five. Comb. Probab. Comput. 30(3): 344-359 (2021) - [j59]Sam Spiro, Jacques Verstraëte:
Relative Turán numbers for hypergraph cycles. Discret. Math. 344(10): 112542 (2021) - [j58]Jiaxi Nie, Sam Spiro, Jacques Verstraëte:
Triangle-Free Subgraphs of Hypergraphs. Graphs Comb. 37(6): 2555-2570 (2021) - [j57]Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Partitioning ordered hypergraphs. J. Comb. Theory A 177: 105300 (2021) - [j56]Jason O'Neill, Jacques Verstraëte:
Non-trivial d-wise intersecting families. J. Comb. Theory A 178: 105369 (2021) - [j55]Jiaxi Nie, Jacques Verstraëte:
Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth. Random Struct. Algorithms 59(1): 79-95 (2021) - [j54]Sam Spiro, Jacques Verstraëte:
Relative Turán Problems for Uniform Hypergraphs. SIAM J. Discret. Math. 35(3): 2170-2191 (2021) - 2020
- [j53]Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2. Discret. Appl. Math. 276: 50-59 (2020) - [j52]Zoltán Füredi, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Ordered and Convex Geometric Trees with Linear Extremal Function. Discret. Comput. Geom. 64(2): 324-338 (2020)
2010 – 2019
- 2019
- [j51]Jacques Verstraëte, Jason Williford:
Graphs without theta subgraphs. J. Comb. Theory B 134: 76-87 (2019) - [j50]Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk. SIAM J. Discret. Math. 33(2): 862-873 (2019) - [i3]Dhruv Mubayi, Jacques Verstraëte:
A note on Pseudorandom Ramsey graphs. CoRR abs/1909.01461 (2019) - 2018
- [j49]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo, Jacques Verstraëte:
Stability in the Erdős-Gallai Theorem on cycles and paths, II. Discret. Math. 341(5): 1253-1263 (2018) - [j48]Victor Falgas-Ravry, Klas Markström, Jacques Verstraëte:
Full subgraphs. J. Graph Theory 88(3): 411-427 (2018) - 2017
- [j47]Alexandr V. Kostochka, Benny Sudakov, Jacques Verstraëte:
Cycles in triangle-free graphs of large chromatic number. Comb. 37(3): 481-494 (2017) - [j46]Benny Sudakov, Jacques Verstraëte:
The Extremal Function for Cycles of Length l mod k. Electron. J. Comb. 24(1): 1 (2017) - [j45]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Turán problems and shadows II: Trees. J. Comb. Theory B 122: 457-478 (2017) - 2016
- [j44]Jacques Verstraëte, Dhruv Mubayi:
Counting Trees in Graphs. Electron. J. Comb. 23(3): 3 (2016) - [j43]Michael Tait, Jacques Verstraëte:
On sets of integers with restrictions on their products. Eur. J. Comb. 51: 268-274 (2016) - [j42]Zoltán Füredi, Alexandr V. Kostochka, Jacques Verstraëte:
Stability in the Erdős-Gallai Theorems on cycles and paths. J. Comb. Theory B 121: 197-228 (2016) - 2015
- [j41]Bob Chen, Jeong Han Kim, Michael Tait, Jacques Verstraëte:
On coupon colorings of graphs. Discret. Appl. Math. 193: 94-101 (2015) - [j40]Jeroen Schillewaert, Jacques Verstraëte:
Probabilistic constructions in generalized quadrangles. Discret. Math. 338(6): 1000-1010 (2015) - [j39]Craig Timmons, Jacques Verstraëte:
A counterexample to sparse removal. Eur. J. Comb. 44: 77-86 (2015) - [j38]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Turán problems and shadows I: Paths and cycles. J. Comb. Theory A 129: 57-79 (2015) - [j37]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Turán Problems and Shadows III: Expansions of Graphs. SIAM J. Discret. Math. 29(2): 868-876 (2015) - [i2]Victor Falgas-Ravry, Klas Markström, Jacques Verstraëte:
Full subgraphs. CoRR abs/1505.03072 (2015) - 2014
- [j36]Peter Allen, Peter Keevash, Benny Sudakov, Jacques Verstraëte:
Turán numbers of bipartite graphs plus an odd cycle. J. Comb. Theory B 106: 134-162 (2014) - [j35]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
On independent sets in hypergraphs. Random Struct. Algorithms 44(2): 224-239 (2014) - 2013
- [j34]Peter Keevash, Benny Sudakov, Jacques Verstraëte:
On a conjecture of Erdős and Simonovits: Even cycles. Comb. 33(6): 699-732 (2013) - [j33]Alex Eustis, Jacques Verstraëte:
On the Independence Number of Steiner Systems. Comb. Probab. Comput. 22(2): 241-252 (2013) - [j32]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Hypergraph Ramsey numbers: Triangles versus cliques. J. Comb. Theory A 120(7): 1491-1507 (2013) - [i1]Michael Tait, Alexander Vardy, Jacques Verstraëte:
Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Permutation Codes. CoRR abs/1311.4925 (2013) - 2012
- [j31]Stefaan De Winter, Jeroen Schillewaert, Jacques Verstraëte:
Large Incidence-free Sets in Geometries. Electron. J. Comb. 19(4): 24 (2012) - [j30]Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte:
On Even-Degree Subgraphs of Linear Hypergraphs. Comb. Probab. Comput. 21(1-2): 113-127 (2012) - [j29]Noga Alon, Keith E. Mellinger, Dhruv Mubayi, Jacques Verstraëte:
The de Bruijn-Erdős theorem for hypergraphs. Des. Codes Cryptogr. 65(3): 233-245 (2012) - 2011
- [j28]Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte:
On Dissemination Thresholds in Regular and Irregular Graph Classes. Algorithmica 59(1): 16-34 (2011) - [j27]Pawel Pralat, Jacques Verstraëte, Nicholas C. Wormald:
On the threshold for k-regular subgraphs of random graphs. Comb. 31(5): 565-581 (2011) - 2010
- [j26]Penny E. Haxell, Jacques Verstraëte:
List Coloring Hypergraphs. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j25]Dhruv Mubayi, Jacques Verstraëte:
Two-regular subgraphs of hypergraphs. J. Comb. Theory B 99(3): 643-655 (2009) - [j24]Oleg Pikhurko, Jacques Verstraëte:
The maximum size of hypergraphs without generalized 4-cycles. J. Comb. Theory A 116(3): 637-649 (2009) - [j23]Sebastian M. Cioaba, André Kündgen, Jacques Verstraëte:
On decompositions of complete hypergraphs. J. Comb. Theory A 116(7): 1232-1234 (2009) - 2008
- [j22]Assaf Naor, Jacques Verstraëte:
Parity check matrices and product representations of squares. Comb. 28(2): 163-185 (2008) - [j21]Benny Sudakov, Jacques Verstraëte:
Cycle lengths in sparse graphs. Comb. 28(3): 357-372 (2008) - [j20]Hamed Shirazi, Jacques Verstraëte:
A Note on Polynomials and f-Factors of Graphs. Electron. J. Comb. 15(1) (2008) - [j19]Stefaan De Winter, Felix Lazebnik, Jacques Verstraëte:
An Extremal Characterization of Projective Planes. Electron. J. Comb. 15(1) (2008) - [j18]Michael Cavers, Jacques Verstraëte:
Clique partitions of complements of forests and bounded degree graphs. Discret. Math. 308(10): 2011-2017 (2008) - [c3]Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte:
On Dissemination Thresholds in Regular and Irregular Graph Classes. LATIN 2008: 24-35 - 2007
- [j17]Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte:
Rainbow Turán Problems. Comb. Probab. Comput. 16(1): 109-126 (2007) - [j16]Dhruv Mubayi, Jacques Verstraëte:
Minimal paths and cycles in set systems. Eur. J. Comb. 28(6): 1681-1693 (2007) - [j15]Penny E. Haxell, Ben Seamone, Jacques Verstraëte:
Independent dominating sets and hamiltonian cycles. J. Graph Theory 54(3): 233-244 (2007) - [j14]Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster:
Approximation algorithms and hardness results for cycle packing problems. ACM Trans. Algorithms 3(4): 48 (2007) - 2006
- [j13]Jacques Verstraëte:
Product representations of polynomials. Eur. J. Comb. 27(8): 1350-1361 (2006) - [j12]Béla Bollobás, Jeong Han Kim, Jacques Verstraëte:
Regular subgraphs of random graphs. Random Struct. Algorithms 29(1): 1-13 (2006) - 2005
- [j11]Dhruv Mubayi, Jacques Verstraëte:
Proof Of A Conjecture Of Erdös On Triangles In Set-Systems. Comb. 25(5): 599-614 (2005) - [j10]Thomas Lam, Jacques Verstraëte:
A Note on Graphs Without Short Even Cycles. Electron. J. Comb. 12 (2005) - [j9]Alexandr V. Kostochka, Jacques Verstraëte:
Even cycles in hypergraphs. J. Comb. Theory B 94(1): 173-182 (2005) - [j8]Jacques Verstraëte:
Unavoidable cycle lengths in graphs. J. Graph Theory 49(2): 151-167 (2005) - [c2]Mohammad R. Salavatipour, Jacques Verstraëte:
Disjoint Cycles: Integrality Gap, Hardness, and Approximation. IPCO 2005: 51-65 - [c1]Assaf Naor, Jacques Verstraëte:
Improved bounds on the size of sparse parity check matrices. ISIT 2005: 1749-1752 - 2004
- [j7]Peter Keevash, Michael E. Saks, Benny Sudakov, Jacques Verstraëte:
Multicolour Turán problems. Adv. Appl. Math. 33(2): 238-262 (2004) - [j6]Jacques Verstraëte:
On The Number Of Sets Of Cycle Lengths. Comb. 24(4): 719-730 (2004) - [j5]Dhruv Mubayi, Jacques Verstraëte:
A hypergraph extension of the bipartite Turán problem. J. Comb. Theory A 106(2): 237-253 (2004) - 2003
- [j4]Felix Lazebnik, Jacques Verstraëte:
On Hypergraphs of Girth Five. Electron. J. Comb. 10 (2003) - [j3]Jacques Verstraëte:
Vertex-disjoint cycles of the same length. J. Comb. Theory B 88(1): 45-52 (2003) - 2002
- [j2]Jacques Verstraëte:
A Note On Vertex-Disjoint Cycles. Comb. Probab. Comput. 11(1): 97-102 (2002) - 2000
- [j1]Jacques Verstraëte:
On Arithmetic Progressions Of Cycle Lengths In Graphs. Comb. Probab. Comput. 9(4): 369-373 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
