Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jacques Verstraëte
@article{DBLP:journals/rsa/ConlonFHMSV23,
author = {David Conlon and
Jacob Fox and
Xiaoyu He and
Dhruv Mubayi and
Andrew Suk and
Jacques Verstra{\"{e}}te},
title = {Hypergraph Ramsey numbers of cliques versus stars},
journal = {Random Struct. Algorithms},
volume = {63},
number = {3},
pages = {610--623},
year = {2023},
url = {https://doi.org/10.1002/rsa.21155},
doi = {10.1002/RSA.21155},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/ConlonFHMSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FurediJKMV23,
author = {Zolt{\'{a}}n F{\"{u}}redi and
Tao Jiang and
Alexandr V. Kostochka and
Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {Extremal Problems for Hypergraph Blowups of Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {37},
number = {4},
pages = {2397--2416},
year = {2023},
url = {https://doi.org/10.1137/22m1543318},
doi = {10.1137/22M1543318},
timestamp = {Fri, 03 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/FurediJKMV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CranstonNVW22,
author = {Daniel W. Cranston and
Jiaxi Nie and
Jacques Verstra{\"{e}}te and
Alexandra Wesolek},
title = {On asymptotic packing of geometric graphs},
journal = {Discret. Appl. Math.},
volume = {322},
pages = {142--152},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.07.030},
doi = {10.1016/J.DAM.2022.07.030},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CranstonNVW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ONeillV22,
author = {Jason O'Neill and
Jacques Verstra{\"{e}}te},
title = {A Note on k-Wise Oddtown Problems},
journal = {Graphs Comb.},
volume = {38},
number = {3},
pages = {101},
year = {2022},
url = {https://doi.org/10.1007/s00373-022-02504-z},
doi = {10.1007/S00373-022-02504-Z},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ONeillV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/FurediMOV22,
author = {Zolt{\'{a}}n F{\"{u}}redi and
Dhruv Mubayi and
Jason O'Neill and
Jacques Verstra{\"{e}}te},
title = {Extremal problems for pairs of triangles},
journal = {J. Comb. Theory, Ser. {B}},
volume = {155},
pages = {83--110},
year = {2022},
url = {https://doi.org/10.1016/j.jctb.2022.02.003},
doi = {10.1016/J.JCTB.2022.02.003},
timestamp = {Fri, 03 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/FurediMOV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SpiroV22,
author = {Sam Spiro and
Jacques Verstra{\"{e}}te},
title = {Counting hypergraphs with large girth},
journal = {J. Graph Theory},
volume = {100},
number = {3},
pages = {543--558},
year = {2022},
url = {https://doi.org/10.1002/jgt.22794},
doi = {10.1002/JGT.22794},
timestamp = {Fri, 03 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SpiroV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/NieV22,
author = {Jiaxi Nie and
Jacques Verstra{\"{e}}te},
title = {Ramsey Numbers for Nontrivial Berge Cycles},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {1},
pages = {103--113},
year = {2022},
url = {https://doi.org/10.1137/21m1396770},
doi = {10.1137/21M1396770},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/NieV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/ONeillV21,
author = {Jason O'Neill and
Jacques Verstra{\"{e}}te},
title = {A Generalization of the Bollob{\'{a}}s Set Pairs Inequality},
journal = {Electron. J. Comb.},
volume = {28},
number = {3},
pages = {3},
year = {2021},
url = {https://doi.org/10.37236/9627},
doi = {10.37236/9627},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/ONeillV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HarutyunyanHV21,
author = {Ararat Harutyunyan and
Paul Horn and
Jacques Verstra{\"{e}}te},
title = {Independent dominating sets in graphs of girth five},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {3},
pages = {344--359},
year = {2021},
url = {https://doi.org/10.1017/S0963548320000279},
doi = {10.1017/S0963548320000279},
timestamp = {Thu, 06 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/HarutyunyanHV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SpiroV21,
author = {Sam Spiro and
Jacques Verstra{\"{e}}te},
title = {Relative Tur{\'{a}}n numbers for hypergraph cycles},
journal = {Discret. Math.},
volume = {344},
number = {10},
pages = {112542},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2021.112542},
doi = {10.1016/J.DISC.2021.112542},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/SpiroV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/NieSV21,
author = {Jiaxi Nie and
Sam Spiro and
Jacques Verstra{\"{e}}te},
title = {Triangle-Free Subgraphs of Hypergraphs},
journal = {Graphs Comb.},
volume = {37},
number = {6},
pages = {2555--2570},
year = {2021},
url = {https://doi.org/10.1007/s00373-021-02388-5},
doi = {10.1007/S00373-021-02388-5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/NieSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcta/FurediJKMV21,
author = {Zolt{\'{a}}n F{\"{u}}redi and
Tao Jiang and
Alexandr V. Kostochka and
Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {Partitioning ordered hypergraphs},
journal = {J. Comb. Theory, Ser. {A}},
volume = {177},
pages = {105300},
year = {2021},
url = {https://doi.org/10.1016/j.jcta.2020.105300},
doi = {10.1016/J.JCTA.2020.105300},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcta/FurediJKMV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcta/ONeillV21,
author = {Jason O'Neill and
Jacques Verstra{\"{e}}te},
title = {Non-trivial \emph{d}-wise intersecting families},
journal = {J. Comb. Theory, Ser. {A}},
volume = {178},
pages = {105369},
year = {2021},
url = {https://doi.org/10.1016/j.jcta.2020.105369},
doi = {10.1016/J.JCTA.2020.105369},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcta/ONeillV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NieV21,
author = {Jiaxi Nie and
Jacques Verstra{\"{e}}te},
title = {Randomized greedy algorithm for independent sets in regular uniform
hypergraphs with large girth},
journal = {Random Struct. Algorithms},
volume = {59},
number = {1},
pages = {79--95},
year = {2021},
url = {https://doi.org/10.1002/rsa.20994},
doi = {10.1002/RSA.20994},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NieV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/SpiroV21,
author = {Sam Spiro and
Jacques Verstra{\"{e}}te},
title = {Relative Tur{\'{a}}n Problems for Uniform Hypergraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {3},
pages = {2170--2191},
year = {2021},
url = {https://doi.org/10.1137/20M1364631},
doi = {10.1137/20M1364631},
timestamp = {Thu, 21 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/SpiroV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FurediJKMV20,
author = {Zolt{\'{a}}n F{\"{u}}redi and
Tao Jiang and
Alexandr V. Kostochka and
Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {Hypergraphs not containing a tight tree with a bounded trunk {II:}
3-trees with a trunk of size 2},
journal = {Discret. Appl. Math.},
volume = {276},
pages = {50--59},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.09.010},
doi = {10.1016/J.DAM.2019.09.010},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/FurediJKMV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/FurediKMV20,
author = {Zolt{\'{a}}n F{\"{u}}redi and
Alexandr V. Kostochka and
Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {Ordered and Convex Geometric Trees with Linear Extremal Function},
journal = {Discret. Comput. Geom.},
volume = {64},
number = {2},
pages = {324--338},
year = {2020},
url = {https://doi.org/10.1007/s00454-019-00149-z},
doi = {10.1007/S00454-019-00149-Z},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/FurediKMV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/VerstraeteW19,
author = {Jacques Verstra{\"{e}}te and
Jason Williford},
title = {Graphs without theta subgraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {134},
pages = {76--87},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2018.05.003},
doi = {10.1016/J.JCTB.2018.05.003},
timestamp = {Wed, 09 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/VerstraeteW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FurediJKMV19,
author = {Zolt{\'{a}}n F{\"{u}}redi and
Tao Jiang and
Alexandr V. Kostochka and
Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {Hypergraphs Not Containing a Tight Tree with a Bounded Trunk},
journal = {{SIAM} J. Discret. Math.},
volume = {33},
number = {2},
pages = {862--873},
year = {2019},
url = {https://doi.org/10.1137/17M1160926},
doi = {10.1137/17M1160926},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FurediJKMV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-01461,
author = {Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {A note on Pseudorandom Ramsey graphs},
journal = {CoRR},
volume = {abs/1909.01461},
year = {2019},
url = {http://arxiv.org/abs/1909.01461},
eprinttype = {arXiv},
eprint = {1909.01461},
timestamp = {Wed, 18 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-01461.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FurediKLV18,
author = {Zolt{\'{a}}n F{\"{u}}redi and
Alexandr V. Kostochka and
Ruth Luo and
Jacques Verstra{\"{e}}te},
title = {Stability in the Erd{\H{o}}s-Gallai Theorem on cycles and paths, {II}},
journal = {Discret. Math.},
volume = {341},
number = {5},
pages = {1253--1263},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2017.12.018},
doi = {10.1016/J.DISC.2017.12.018},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FurediKLV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Falgas-RavryMV18,
author = {Victor Falgas{-}Ravry and
Klas Markstr{\"{o}}m and
Jacques Verstra{\"{e}}te},
title = {Full subgraphs},
journal = {J. Graph Theory},
volume = {88},
number = {3},
pages = {411--427},
year = {2018},
url = {https://doi.org/10.1002/jgt.22221},
doi = {10.1002/JGT.22221},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Falgas-RavryMV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KostochkaSV17,
author = {Alexandr V. Kostochka and
Benny Sudakov and
Jacques Verstra{\"{e}}te},
title = {Cycles in triangle-free graphs of large chromatic number},
journal = {Comb.},
volume = {37},
number = {3},
pages = {481--494},
year = {2017},
url = {https://doi.org/10.1007/s00493-015-3262-0},
doi = {10.1007/S00493-015-3262-0},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/KostochkaSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/SudakovV17,
author = {Benny Sudakov and
Jacques Verstra{\"{e}}te},
title = {The Extremal Function for Cycles of Length l mod k},
journal = {Electron. J. Comb.},
volume = {24},
number = {1},
pages = {1},
year = {2017},
url = {https://doi.org/10.37236/6257},
doi = {10.37236/6257},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/SudakovV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KostochkaMV17,
author = {Alexandr V. Kostochka and
Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {Tur{\'{a}}n problems and shadows {II:} Trees},
journal = {J. Comb. Theory, Ser. {B}},
volume = {122},
pages = {457--478},
year = {2017},
url = {https://doi.org/10.1016/j.jctb.2016.06.011},
doi = {10.1016/J.JCTB.2016.06.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KostochkaMV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/VerstraeteM16,
author = {Jacques Verstra{\"{e}}te and
Dhruv Mubayi},
title = {Counting Trees in Graphs},
journal = {Electron. J. Comb.},
volume = {23},
number = {3},
pages = {3},
year = {2016},
url = {https://doi.org/10.37236/6084},
doi = {10.37236/6084},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/VerstraeteM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/TaitV16,
author = {Michael Tait and
Jacques Verstra{\"{e}}te},
title = {On sets of integers with restrictions on their products},
journal = {Eur. J. Comb.},
volume = {51},
pages = {268--274},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2015.05.016},
doi = {10.1016/J.EJC.2015.05.016},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/TaitV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FurediKV16,
author = {Zolt{\'{a}}n F{\"{u}}redi and
Alexandr V. Kostochka and
Jacques Verstra{\"{e}}te},
title = {Stability in the Erd{\H{o}}s-Gallai Theorems on cycles and paths},
journal = {J. Comb. Theory, Ser. {B}},
volume = {121},
pages = {197--228},
year = {2016},
url = {https://doi.org/10.1016/j.jctb.2016.06.004},
doi = {10.1016/J.JCTB.2016.06.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FurediKV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenKTV15,
author = {Bob Chen and
Jeong Han Kim and
Michael Tait and
Jacques Verstra{\"{e}}te},
title = {On coupon colorings of graphs},
journal = {Discret. Appl. Math.},
volume = {193},
pages = {94--101},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.04.026},
doi = {10.1016/J.DAM.2015.04.026},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChenKTV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SchillewaertV15,
author = {Jeroen Schillewaert and
Jacques Verstra{\"{e}}te},
title = {Probabilistic constructions in generalized quadrangles},
journal = {Discret. Math.},
volume = {338},
number = {6},
pages = {1000--1010},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2015.01.020},
doi = {10.1016/J.DISC.2015.01.020},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SchillewaertV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/TimmonsV15,
author = {Craig Timmons and
Jacques Verstra{\"{e}}te},
title = {A counterexample to sparse removal},
journal = {Eur. J. Comb.},
volume = {44},
pages = {77--86},
year = {2015},
url = {https://doi.org/10.1016/j.ejc.2014.09.008},
doi = {10.1016/J.EJC.2014.09.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/TimmonsV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KostochkaMV15,
author = {Alexandr V. Kostochka and
Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {Tur{\'{a}}n problems and shadows {I:} Paths and cycles},
journal = {J. Comb. Theory, Ser. {A}},
volume = {129},
pages = {57--79},
year = {2015},
url = {https://doi.org/10.1016/j.jcta.2014.09.005},
doi = {10.1016/J.JCTA.2014.09.005},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/KostochkaMV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KostochkaMV15,
author = {Alexandr V. Kostochka and
Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {Tur{\'{a}}n Problems and Shadows {III:} Expansions of Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {2},
pages = {868--876},
year = {2015},
url = {https://doi.org/10.1137/140977138},
doi = {10.1137/140977138},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KostochkaMV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Falgas-RavryMV15,
author = {Victor Falgas{-}Ravry and
Klas Markstr{\"{o}}m and
Jacques Verstra{\"{e}}te},
title = {Full subgraphs},
journal = {CoRR},
volume = {abs/1505.03072},
year = {2015},
url = {http://arxiv.org/abs/1505.03072},
eprinttype = {arXiv},
eprint = {1505.03072},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Falgas-RavryMV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/AllenKSV14,
author = {Peter Allen and
Peter Keevash and
Benny Sudakov and
Jacques Verstra{\"{e}}te},
title = {Tur{\'{a}}n numbers of bipartite graphs plus an odd cycle},
journal = {J. Comb. Theory, Ser. {B}},
volume = {106},
pages = {134--162},
year = {2014},
url = {https://doi.org/10.1016/j.jctb.2014.01.007},
doi = {10.1016/J.JCTB.2014.01.007},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/AllenKSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KostochkaMV14,
author = {Alexandr V. Kostochka and
Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {On independent sets in hypergraphs},
journal = {Random Struct. Algorithms},
volume = {44},
number = {2},
pages = {224--239},
year = {2014},
url = {https://doi.org/10.1002/rsa.20453},
doi = {10.1002/RSA.20453},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KostochkaMV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KeevashSV13,
author = {Peter Keevash and
Benny Sudakov and
Jacques Verstra{\"{e}}te},
title = {On a conjecture of Erd{\H{o}}s and Simonovits: Even cycles},
journal = {Comb.},
volume = {33},
number = {6},
pages = {699--732},
year = {2013},
url = {https://doi.org/10.1007/s00493-013-2863-8},
doi = {10.1007/S00493-013-2863-8},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/KeevashSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/EustisV13,
author = {Alex Eustis and
Jacques Verstra{\"{e}}te},
title = {On the Independence Number of Steiner Systems},
journal = {Comb. Probab. Comput.},
volume = {22},
number = {2},
pages = {241--252},
year = {2013},
url = {https://doi.org/10.1017/S0963548312000557},
doi = {10.1017/S0963548312000557},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/EustisV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KostochkaMV13,
author = {Alexandr V. Kostochka and
Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {Hypergraph Ramsey numbers: Triangles versus cliques},
journal = {J. Comb. Theory, Ser. {A}},
volume = {120},
number = {7},
pages = {1491--1507},
year = {2013},
url = {https://doi.org/10.1016/j.jcta.2013.04.009},
doi = {10.1016/J.JCTA.2013.04.009},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/KostochkaMV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/TaitVV13,
author = {Michael Tait and
Alexander Vardy and
Jacques Verstra{\"{e}}te},
title = {Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size
of Permutation Codes},
journal = {CoRR},
volume = {abs/1311.4925},
year = {2013},
url = {http://arxiv.org/abs/1311.4925},
eprinttype = {arXiv},
eprint = {1311.4925},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/TaitVV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/WinterSV12,
author = {Stefaan De Winter and
Jeroen Schillewaert and
Jacques Verstra{\"{e}}te},
title = {Large Incidence-free Sets in Geometries},
journal = {Electron. J. Comb.},
volume = {19},
number = {4},
pages = {24},
year = {2012},
url = {https://doi.org/10.37236/2831},
doi = {10.37236/2831},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/WinterSV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DellamonicaHLMNPRSV12,
author = {Domingos Dellamonica Jr. and
Penny E. Haxell and
Tomasz Luczak and
Dhruv Mubayi and
Brendan Nagle and
Yury Person and
Vojtech R{\"{o}}dl and
Mathias Schacht and
Jacques Verstra{\"{e}}te},
title = {On Even-Degree Subgraphs of Linear Hypergraphs},
journal = {Comb. Probab. Comput.},
volume = {21},
number = {1-2},
pages = {113--127},
year = {2012},
url = {https://doi.org/10.1017/S0963548311000575},
doi = {10.1017/S0963548311000575},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/DellamonicaHLMNPRSV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcc/AlonMMV12,
author = {Noga Alon and
Keith E. Mellinger and
Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {The de Bruijn-Erd{\H{o}}s theorem for hypergraphs},
journal = {Des. Codes Cryptogr.},
volume = {65},
number = {3},
pages = {233--245},
year = {2012},
url = {https://doi.org/10.1007/s10623-011-9555-4},
doi = {10.1007/S10623-011-9555-4},
timestamp = {Mon, 17 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcc/AlonMMV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RapaportSTV11,
author = {Ivan Rapaport and
Karol Suchan and
Ioan Todinca and
Jacques Verstra{\"{e}}te},
title = {On Dissemination Thresholds in Regular and Irregular Graph Classes},
journal = {Algorithmica},
volume = {59},
number = {1},
pages = {16--34},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9309-0},
doi = {10.1007/S00453-009-9309-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RapaportSTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/PralatVW11,
author = {Pawel Pralat and
Jacques Verstra{\"{e}}te and
Nicholas C. Wormald},
title = {On the threshold for k-regular subgraphs of random graphs},
journal = {Comb.},
volume = {31},
number = {5},
pages = {565--581},
year = {2011},
url = {https://doi.org/10.1007/s00493-011-2545-3},
doi = {10.1007/S00493-011-2545-3},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/PralatVW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/HaxellV10,
author = {Penny E. Haxell and
Jacques Verstra{\"{e}}te},
title = {List Coloring Hypergraphs},
journal = {Electron. J. Comb.},
volume = {17},
number = {1},
year = {2010},
url = {https://doi.org/10.37236/401},
doi = {10.37236/401},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/HaxellV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/MubayiV09,
author = {Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {Two-regular subgraphs of hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {99},
number = {3},
pages = {643--655},
year = {2009},
url = {https://doi.org/10.1016/j.jctb.2008.10.005},
doi = {10.1016/J.JCTB.2008.10.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/MubayiV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/PikhurkoV09,
author = {Oleg Pikhurko and
Jacques Verstra{\"{e}}te},
title = {The maximum size of hypergraphs without generalized 4-cycles},
journal = {J. Comb. Theory, Ser. {A}},
volume = {116},
number = {3},
pages = {637--649},
year = {2009},
url = {https://doi.org/10.1016/j.jcta.2008.09.002},
doi = {10.1016/J.JCTA.2008.09.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/PikhurkoV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/CioabaKV09,
author = {Sebastian M. Cioaba and
Andr{\'{e}} K{\"{u}}ndgen and
Jacques Verstra{\"{e}}te},
title = {On decompositions of complete hypergraphs},
journal = {J. Comb. Theory, Ser. {A}},
volume = {116},
number = {7},
pages = {1232--1234},
year = {2009},
url = {https://doi.org/10.1016/j.jcta.2009.02.007},
doi = {10.1016/J.JCTA.2009.02.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/CioabaKV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/NaorV08,
author = {Assaf Naor and
Jacques Verstra{\"{e}}te},
title = {Parity check matrices and product representations of squares},
journal = {Comb.},
volume = {28},
number = {2},
pages = {163--185},
year = {2008},
url = {https://doi.org/10.1007/s00493-008-2195-2},
doi = {10.1007/S00493-008-2195-2},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/NaorV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/SudakovV08,
author = {Benny Sudakov and
Jacques Verstra{\"{e}}te},
title = {Cycle lengths in sparse graphs},
journal = {Comb.},
volume = {28},
number = {3},
pages = {357--372},
year = {2008},
url = {https://doi.org/10.1007/s00493-008-2300-6},
doi = {10.1007/S00493-008-2300-6},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/SudakovV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/ShiraziV08,
author = {Hamed Shirazi and
Jacques Verstra{\"{e}}te},
title = {A Note on Polynomials and f-Factors of Graphs},
journal = {Electron. J. Comb.},
volume = {15},
number = {1},
year = {2008},
url = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1n22.html},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/ShiraziV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/WinterLV08,
author = {Stefaan De Winter and
Felix Lazebnik and
Jacques Verstra{\"{e}}te},
title = {An Extremal Characterization of Projective Planes},
journal = {Electron. J. Comb.},
volume = {15},
number = {1},
year = {2008},
url = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1r143.html},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/WinterLV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CaversV08,
author = {Michael Cavers and
Jacques Verstra{\"{e}}te},
title = {Clique partitions of complements of forests and bounded degree graphs},
journal = {Discret. Math.},
volume = {308},
number = {10},
pages = {2011--2017},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.04.041},
doi = {10.1016/J.DISC.2007.04.041},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CaversV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/RapaportSTV08,
author = {Ivan Rapaport and
Karol Suchan and
Ioan Todinca and
Jacques Verstra{\"{e}}te},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {On Dissemination Thresholds in Regular and Irregular Graph Classes},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {24--35},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_3},
doi = {10.1007/978-3-540-78773-0\_3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/RapaportSTV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KeevashMSV07,
author = {Peter Keevash and
Dhruv Mubayi and
Benny Sudakov and
Jacques Verstra{\"{e}}te},
title = {Rainbow Tur{\'{a}}n Problems},
journal = {Comb. Probab. Comput.},
volume = {16},
number = {1},
pages = {109--126},
year = {2007},
url = {https://doi.org/10.1017/S0963548306007760},
doi = {10.1017/S0963548306007760},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/KeevashMSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/MubayiV07,
author = {Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {Minimal paths and cycles in set systems},
journal = {Eur. J. Comb.},
volume = {28},
number = {6},
pages = {1681--1693},
year = {2007},
url = {https://doi.org/10.1016/j.ejc.2006.07.001},
doi = {10.1016/J.EJC.2006.07.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/MubayiV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HaxellSV07,
author = {Penny E. Haxell and
Ben Seamone and
Jacques Verstra{\"{e}}te},
title = {Independent dominating sets and hamiltonian cycles},
journal = {J. Graph Theory},
volume = {54},
number = {3},
pages = {233--244},
year = {2007},
url = {https://doi.org/10.1002/jgt.20205},
doi = {10.1002/JGT.20205},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HaxellSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KrivelevichNSYY07,
author = {Michael Krivelevich and
Zeev Nutov and
Mohammad R. Salavatipour and
Jacques Verstra{\"{e}}te and
Raphael Yuster},
title = {Approximation algorithms and hardness results for cycle packing problems},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {4},
pages = {48},
year = {2007},
url = {https://doi.org/10.1145/1290672.1290685},
doi = {10.1145/1290672.1290685},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/KrivelevichNSYY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Verstraete06,
author = {Jacques Verstra{\"{e}}te},
title = {Product representations of polynomials},
journal = {Eur. J. Comb.},
volume = {27},
number = {8},
pages = {1350--1361},
year = {2006},
url = {https://doi.org/10.1016/j.ejc.2006.05.009},
doi = {10.1016/J.EJC.2006.05.009},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Verstraete06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasKV06,
author = {B{\'{e}}la Bollob{\'{a}}s and
Jeong Han Kim and
Jacques Verstra{\"{e}}te},
title = {Regular subgraphs of random graphs},
journal = {Random Struct. Algorithms},
volume = {29},
number = {1},
pages = {1--13},
year = {2006},
url = {https://doi.org/10.1002/rsa.20123},
doi = {10.1002/RSA.20123},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasKV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/MubayiV05,
author = {Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {Proof Of {A} Conjecture Of Erd{\"{o}}s On Triangles In Set-Systems},
journal = {Comb.},
volume = {25},
number = {5},
pages = {599--614},
year = {2005},
url = {https://doi.org/10.1007/s00493-005-0036-0},
doi = {10.1007/S00493-005-0036-0},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/MubayiV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/LamV05,
author = {Thomas Lam and
Jacques Verstra{\"{e}}te},
title = {A Note on Graphs Without Short Even Cycles},
journal = {Electron. J. Comb.},
volume = {12},
year = {2005},
url = {https://doi.org/10.37236/1972},
doi = {10.37236/1972},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/LamV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KostochkaV05,
author = {Alexandr V. Kostochka and
Jacques Verstra{\"{e}}te},
title = {Even cycles in hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {94},
number = {1},
pages = {173--182},
year = {2005},
url = {https://doi.org/10.1016/j.jctb.2004.12.004},
doi = {10.1016/J.JCTB.2004.12.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KostochkaV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Verstraete05,
author = {Jacques Verstra{\"{e}}te},
title = {Unavoidable cycle lengths in graphs},
journal = {J. Graph Theory},
volume = {49},
number = {2},
pages = {151--167},
year = {2005},
url = {https://doi.org/10.1002/jgt.20072},
doi = {10.1002/JGT.20072},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Verstraete05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/SalavatipourV05,
author = {Mohammad R. Salavatipour and
Jacques Verstra{\"{e}}te},
editor = {Michael J{\"{u}}nger and
Volker Kaibel},
title = {Disjoint Cycles: Integrality Gap, Hardness, and Approximation},
booktitle = {Integer Programming and Combinatorial Optimization, 11th International
{IPCO} Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3509},
pages = {51--65},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11496915\_5},
doi = {10.1007/11496915\_5},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/SalavatipourV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/NaorV05,
author = {Assaf Naor and
Jacques Verstra{\"{e}}te},
title = {Improved bounds on the size of sparse parity check matrices},
booktitle = {Proceedings of the 2005 {IEEE} International Symposium on Information
Theory, {ISIT} 2005, Adelaide, South Australia, Australia, 4-9 September
2005},
pages = {1749--1752},
publisher = {{IEEE}},
year = {2005},
url = {https://doi.org/10.1109/ISIT.2005.1523645},
doi = {10.1109/ISIT.2005.1523645},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/NaorV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aam/KeevashSSV04,
author = {Peter Keevash and
Michael E. Saks and
Benny Sudakov and
Jacques Verstra{\"{e}}te},
title = {Multicolour Tur{\'{a}}n problems},
journal = {Adv. Appl. Math.},
volume = {33},
number = {2},
pages = {238--262},
year = {2004},
url = {https://doi.org/10.1016/j.aam.2003.08.005},
doi = {10.1016/J.AAM.2003.08.005},
timestamp = {Thu, 12 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aam/KeevashSSV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Verstraete04,
author = {Jacques Verstra{\"{e}}te},
title = {On The Number Of Sets Of Cycle Lengths},
journal = {Comb.},
volume = {24},
number = {4},
pages = {719--730},
year = {2004},
url = {https://doi.org/10.1007/s00493-004-0043-6},
doi = {10.1007/S00493-004-0043-6},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Verstraete04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/MubayiV04,
author = {Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {A hypergraph extension of the bipartite Tur{\'{a}}n problem},
journal = {J. Comb. Theory, Ser. {A}},
volume = {106},
number = {2},
pages = {237--253},
year = {2004},
url = {https://doi.org/10.1016/j.jcta.2004.02.002},
doi = {10.1016/J.JCTA.2004.02.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/MubayiV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/LazebnikV03,
author = {Felix Lazebnik and
Jacques Verstra{\"{e}}te},
title = {On Hypergraphs of Girth Five},
journal = {Electron. J. Comb.},
volume = {10},
year = {2003},
url = {https://doi.org/10.37236/1718},
doi = {10.37236/1718},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/LazebnikV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Verstraete03,
author = {Jacques Verstra{\"{e}}te},
title = {Vertex-disjoint cycles of the same length},
journal = {J. Comb. Theory, Ser. {B}},
volume = {88},
number = {1},
pages = {45--52},
year = {2003},
url = {https://doi.org/10.1016/S0095-8956(02)00012-6},
doi = {10.1016/S0095-8956(02)00012-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Verstraete03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Verstraete02,
author = {Jacques Verstra{\"{e}}te},
title = {A Note On Vertex-Disjoint Cycles},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {1},
pages = {97--102},
year = {2002},
url = {https://doi.org/10.1017/S0963548301004904},
doi = {10.1017/S0963548301004904},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Verstraete02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Verstraete00,
author = {Jacques Verstra{\"{e}}te},
title = {On Arithmetic Progressions Of Cycle Lengths In Graphs},
journal = {Comb. Probab. Comput.},
volume = {9},
number = {4},
pages = {369--373},
year = {2000},
url = {http://journals.cambridge.org/action/displayAbstract?aid=59783},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Verstraete00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:38 CEST 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:
