Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Mathias Schacht
@inproceedings{DBLP:conf/lagos/KamcevS23,
author = {Nina Kamcev and
Mathias Schacht},
editor = {Cristina G. Fernandes and
Sergio Rajsbaum},
title = {Canonical colourings in random graphs},
booktitle = {Proceedings of the {XII} Latin-American Algorithms, Graphs and Optimization
Symposium, {LAGOS} 2023, Huatulco, Mexico, September 18-22, 2023},
series = {Procedia Computer Science},
volume = {223},
pages = {5--12},
publisher = {Elsevier},
year = {2023},
url = {https://doi.org/10.1016/j.procs.2023.08.207},
doi = {10.1016/J.PROCS.2023.08.207},
timestamp = {Tue, 16 Jan 2024 15:18:39 +0100},
biburl = {https://dblp.org/rec/conf/lagos/KamcevS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AraujoPS22,
author = {Pedro Ara{\'{u}}jo and
Sim{\'{o}}n Piga and
Mathias Schacht},
title = {Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform
Hypergraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {1},
pages = {147--169},
year = {2022},
url = {https://doi.org/10.1137/21m1408531},
doi = {10.1137/21M1408531},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AraujoPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BalBDS21,
author = {Deepak Bal and
Ross Berkowitz and
Pat Devlin and
Mathias Schacht},
title = {Hamiltonian Berge cycles in random hypergraphs},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {2},
pages = {228--238},
year = {2021},
url = {https://doi.org/10.1017/S0963548320000437},
doi = {10.1017/S0963548320000437},
timestamp = {Thu, 04 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/BalBDS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BalBDS21a,
author = {Deepak Bal and
Ross Berkowitz and
Pat Devlin and
Mathias Schacht},
title = {Finding tight Hamilton cycles in random hypergraphs faster},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {2},
pages = {239--257},
year = {2021},
url = {https://doi.org/10.1017/S0963548320000450},
doi = {10.1017/S0963548320000450},
timestamp = {Thu, 04 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/BalBDS21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ClemensMRST21,
author = {Dennis Clemens and
Meysam Miralaei and
Damian Reding and
Mathias Schacht and
Anusch Taraz},
title = {On the size-Ramsey number of grid graphs},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {5},
pages = {670--685},
year = {2021},
url = {https://doi.org/10.1017/S0963548320000322},
doi = {10.1017/S0963548320000322},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/ClemensMRST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HanRRS21,
author = {Hi{\^{e}}p H{\`{a}}n and
Troy Retter and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Ramsey-type numbers involving graphs and hypergraphs with large girth},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {5},
pages = {722--740},
year = {2021},
url = {https://doi.org/10.1017/S0963548320000383},
doi = {10.1017/S0963548320000383},
timestamp = {Thu, 06 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/HanRRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AntoniukDRRS21,
author = {Sylwia Antoniuk and
Andrzej Dudek and
Christian Reiher and
Andrzej Rucinski and
Mathias Schacht},
title = {High powers of Hamiltonian cycles in randomly augmented graphs},
journal = {J. Graph Theory},
volume = {98},
number = {2},
pages = {255--284},
year = {2021},
url = {https://doi.org/10.1002/jgt.22691},
doi = {10.1002/JGT.22691},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AntoniukDRRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lagos/BergerPRRS21,
author = {S{\"{o}}ren Berger and
Sim{\'{o}}n Piga and
Christian Reiher and
Vojtech R{\"{o}}dl and
Mathias Schacht},
editor = {Carlos E. Ferreira and
Orlando Lee and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Tur{\'{a}}n density of cliques of order five in 3-uniform hypergraphs
with quasirandom links},
booktitle = {Proceedings of the {XI} Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2021, Online Event / S{\~{a}}o Paulo,
Brazil, May 2021},
series = {Procedia Computer Science},
volume = {195},
pages = {412--418},
publisher = {Elsevier},
year = {2021},
url = {https://doi.org/10.1016/j.procs.2021.11.050},
doi = {10.1016/J.PROCS.2021.11.050},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lagos/BergerPRRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/EbsenS20,
author = {Oliver Ebsen and
Mathias Schacht},
title = {Homomorphism Thresholds for Odd Cycles},
journal = {Comb.},
volume = {40},
number = {1},
pages = {39--62},
year = {2020},
url = {https://doi.org/10.1007/s00493-019-3920-8},
doi = {10.1007/S00493-019-3920-8},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/EbsenS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/OberkampfS20,
author = {Heiner Oberkampf and
Mathias Schacht},
title = {On the structure of Dense graphs with bounded clique number},
journal = {Comb. Probab. Comput.},
volume = {29},
number = {5},
pages = {641--649},
year = {2020},
url = {https://doi.org/10.1017/S0963548319000324},
doi = {10.1017/S0963548319000324},
timestamp = {Mon, 16 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/OberkampfS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DudekRRS20,
author = {Andrzej Dudek and
Christian Reiher and
Andrzej Rucinski and
Mathias Schacht},
title = {Powers of Hamiltonian cycles in randomly augmented graphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {122--141},
year = {2020},
url = {https://doi.org/10.1002/rsa.20870},
doi = {10.1002/RSA.20870},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DudekRRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NarayananS20,
author = {Bhargav P. Narayanan and
Mathias Schacht},
title = {Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs},
journal = {Random Struct. Algorithms},
volume = {57},
number = {1},
pages = {244--255},
year = {2020},
url = {https://doi.org/10.1002/rsa.20919},
doi = {10.1002/RSA.20919},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/NarayananS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EbsenMRSS20,
author = {Oliver Ebsen and
Giulia S. Maesaka and
Christian Reiher and
Mathias Schacht and
Bjarne Sch{\"{u}}lke},
title = {Embedding spanning subgraphs in uniformly dense and inseparable graphs},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {1077--1096},
year = {2020},
url = {https://doi.org/10.1002/rsa.20957},
doi = {10.1002/RSA.20957},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/EbsenMRSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BedenknechtMRS19,
author = {Wiebke Bedenknecht and
Guilherme Oliveira Mota and
Christian Reiher and
Mathias Schacht},
title = {On the local density problem for graphs of given odd-girth},
journal = {J. Graph Theory},
volume = {90},
number = {2},
pages = {137--149},
year = {2019},
url = {https://doi.org/10.1002/jgt.22372},
doi = {10.1002/JGT.22372},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BedenknechtMRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cdm/BastosMSSS18,
author = {Josefran de Oliveira Bastos and
Guilherme Oliveira Mota and
Mathias Schacht and
Jakob Schnitzer and
Fabian Schulenburg},
title = {Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version},
journal = {Contributions Discret. Math.},
volume = {13},
number = {2},
year = {2018},
url = {https://cdm.ucalgary.ca/cdm/index.php/cdm/article/view/793},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cdm/BastosMSSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Aigner-HorevCHP18,
author = {Elad Aigner{-}Horev and
David Conlon and
Hi{\^{e}}p H{\`{a}}n and
Yury Person and
Mathias Schacht},
title = {Quasirandomness in Hypergraphs},
journal = {Electron. J. Comb.},
volume = {25},
number = {3},
pages = {3},
year = {2018},
url = {https://doi.org/10.37236/7537},
doi = {10.37236/7537},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/Aigner-HorevCHP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlms/ReiherRS18,
author = {Christian Reiher and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Hypergraphs with vanishing Tur{\'{a}}n density in uniformly dense
hypergraphs},
journal = {J. Lond. Math. Soc.},
volume = {97},
number = {1},
pages = {77--97},
year = {2018},
url = {https://doi.org/10.1112/jlms.12095},
doi = {10.1112/JLMS.12095},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jlms/ReiherRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SchachtS18,
author = {Mathias Schacht and
Fabian Schulenburg},
title = {Sharp thresholds for Ramsey properties of strictly balanced nearly
bipartite graphs},
journal = {Random Struct. Algorithms},
volume = {52},
number = {1},
pages = {3--40},
year = {2018},
url = {https://doi.org/10.1002/rsa.20723},
doi = {10.1002/RSA.20723},
timestamp = {Fri, 01 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/SchachtS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NagleRS18,
author = {Brendan Nagle and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {An algorithmic hypergraph regularity lemma},
journal = {Random Struct. Algorithms},
volume = {52},
number = {2},
pages = {301--353},
year = {2018},
url = {https://doi.org/10.1002/rsa.20739},
doi = {10.1002/RSA.20739},
timestamp = {Thu, 01 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/NagleRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/RodlRS17,
author = {Vojtech R{\"{o}}dl and
Andrzej Rucinski and
Mathias Schacht},
title = {An exponential-type upper bound for Folkman numbers},
journal = {Comb.},
volume = {37},
number = {4},
pages = {767--784},
year = {2017},
url = {https://doi.org/10.1007/s00493-015-3298-1},
doi = {10.1007/S00493-015-3298-1},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/RodlRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Rodl0S17,
author = {Vojtech R{\"{o}}dl and
Andrzej Rucinski and
Mathias Schacht},
title = {Ramsey properties of random graphs and Folkman numbers},
journal = {Discuss. Math. Graph Theory},
volume = {37},
number = {3},
pages = {755--776},
year = {2017},
url = {https://doi.org/10.7151/dmgt.1971},
doi = {10.7151/DMGT.1971},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Rodl0S17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KohayakawaMST17,
author = {Yoshiharu Kohayakawa and
Guilherme Oliveira Mota and
Mathias Schacht and
Anusch Taraz},
title = {Counting results for sparse pseudorandom hypergraphs {I}},
journal = {Eur. J. Comb.},
volume = {65},
pages = {276--287},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2017.04.008},
doi = {10.1016/J.EJC.2017.04.008},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/KohayakawaMST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KohayakawaMST17a,
author = {Yoshiharu Kohayakawa and
Guilherme Oliveira Mota and
Mathias Schacht and
Anusch Taraz},
title = {Counting results for sparse pseudorandom hypergraphs {II}},
journal = {Eur. J. Comb.},
volume = {65},
pages = {288--301},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2017.04.007},
doi = {10.1016/J.EJC.2017.04.007},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/KohayakawaMST17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Aigner-HorevCHP17,
author = {Elad Aigner{-}Horev and
David Conlon and
Hi{\^{e}}p H{\`{a}}n and
Yury Person and
Mathias Schacht},
title = {Quasirandomness in hypergraphs},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {13--19},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.06.015},
doi = {10.1016/J.ENDM.2017.06.015},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/Aigner-HorevCHP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BastosMSSS17,
author = {Josefran de Oliveira Bastos and
Guilherme Oliveira Mota and
Mathias Schacht and
Jakob Schnitzer and
Fabian Schulenburg},
title = {Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {101--106},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.06.026},
doi = {10.1016/J.ENDM.2017.06.026},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/BastosMSSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KohayakawaMS17,
author = {Yoshiharu Kohayakawa and
Guilherme Oliveira Mota and
Mathias Schacht},
title = {Monochromatic trees in random graphs},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {759--764},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.07.033},
doi = {10.1016/J.ENDM.2017.07.033},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/KohayakawaMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BedenknechtMRS17,
author = {Wiebke Bedenknecht and
Guilherme Oliveira Mota and
Christian Reiher and
Mathias Schacht},
title = {On the local density problem for graphs of given odd-girth},
journal = {Electron. Notes Discret. Math.},
volume = {62},
pages = {39--44},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.10.008},
doi = {10.1016/J.ENDM.2017.10.008},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/BedenknechtMRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BastosMSSS17,
author = {Josefran de Oliveira Bastos and
Guilherme Oliveira Mota and
Mathias Schacht and
Jakob Schnitzer and
Fabian Schulenburg},
title = {Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate
Version},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {4},
pages = {2328--2347},
year = {2017},
url = {https://doi.org/10.1137/16M1065732},
doi = {10.1137/16M1065732},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BastosMSSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BastosMSSS16,
author = {Josefran de Oliveira Bastos and
Guilherme Oliveira Mota and
Mathias Schacht and
Jakob Schnitzer and
Fabian Schulenburg},
title = {Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version},
journal = {Electron. Notes Discret. Math.},
volume = {54},
pages = {325--330},
year = {2016},
url = {https://doi.org/10.1016/j.endm.2016.09.056},
doi = {10.1016/J.ENDM.2016.09.056},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/BastosMSSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/MessutiRS16,
author = {Silvia Messuti and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Packing minor-closed families of graphs into complete graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {119},
pages = {245--265},
year = {2016},
url = {https://doi.org/10.1016/j.jctb.2016.03.003},
doi = {10.1016/J.JCTB.2016.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/MessutiRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ReiherRS16,
author = {Christian Reiher and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Embedding tetrahedra into quasirandom hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {121},
pages = {229--247},
year = {2016},
url = {https://doi.org/10.1016/j.jctb.2016.06.008},
doi = {10.1016/J.JCTB.2016.06.008},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/ReiherRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/NagleRS16,
author = {Brendan Nagle and
Vojtech R{\"{o}}dl and
Mathias Schacht},
editor = {Robert Krauthgamer},
title = {An Algorithmic Hypergraph Regularity Lemma},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1765--1773},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch122},
doi = {10.1137/1.9781611974331.CH122},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/NagleRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/MotaSST15,
author = {Guilherme Oliveira Mota and
G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Mathias Schacht and
Anusch Taraz},
title = {Ramsey numbers for bipartite graphs with small bandwidth},
journal = {Eur. J. Comb.},
volume = {48},
pages = {165--176},
year = {2015},
url = {https://doi.org/10.1016/j.ejc.2015.02.018},
doi = {10.1016/J.EJC.2015.02.018},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/MotaSST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/MessutiRS15,
author = {Silvia Messuti and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Packing minor closed families of graphs},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {651--659},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.088},
doi = {10.1016/J.ENDM.2015.06.088},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/MessutiRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KohayakawaMST15,
author = {Yoshiharu Kohayakawa and
Guilherme Oliveira Mota and
Mathias Schacht and
Anusch Taraz},
title = {A counting lemma for sparse pseudorandom hypergraphs},
journal = {Electron. Notes Discret. Math.},
volume = {50},
pages = {421--426},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.07.070},
doi = {10.1016/J.ENDM.2015.07.070},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/KohayakawaMST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HanRRS15,
author = {Hi{\^{e}}p H{\`{a}}n and
Troy Retter and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Ramsey-type numbers involving graphs and hypergraphs with large girth},
journal = {Electron. Notes Discret. Math.},
volume = {50},
pages = {457--463},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.07.076},
doi = {10.1016/J.ENDM.2015.07.076},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HanRRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MessutiS15,
author = {Silvia Messuti and
Mathias Schacht},
title = {On the Structure of Graphs with Given Odd Girth and Large Minimum
Degree},
journal = {J. Graph Theory},
volume = {80},
number = {1},
pages = {69--81},
year = {2015},
url = {https://doi.org/10.1002/jgt.21840},
doi = {10.1002/JGT.21840},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/MessutiS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Aigner-HorevHS14,
author = {Elad Aigner{-}Horev and
Hi{\^{e}}p H{\`{a}}n and
Mathias Schacht},
title = {Extremal results for odd cycles in sparse pseudorandom graphs},
journal = {Comb.},
volume = {34},
number = {4},
pages = {379--406},
year = {2014},
url = {https://doi.org/10.1007/s00493-014-2912-y},
doi = {10.1007/S00493-014-2912-Y},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Aigner-HorevHS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KohayakawaSS14,
author = {Yoshiharu Kohayakawa and
Mathias Schacht and
Reto Sp{\"{o}}hel},
title = {Upper bounds on probability thresholds for asymmetric Ramsey properties},
journal = {Random Struct. Algorithms},
volume = {44},
number = {1},
pages = {1--28},
year = {2014},
url = {https://doi.org/10.1002/rsa.20446},
doi = {10.1002/RSA.20446},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KohayakawaSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Aigner-HorevHS13,
author = {Elad Aigner{-}Horev and
Hi{\^{e}}p H{\`{a}}n and
Mathias Schacht},
title = {Extremal results for odd cycles in sparse pseudorandom graphs},
journal = {Electron. Notes Discret. Math.},
volume = {44},
pages = {385--391},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.10.060},
doi = {10.1016/J.ENDM.2013.10.060},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/Aigner-HorevHS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BussHS13,
author = {Enno Bu{\ss} and
Hi{\^{e}}p H{\`{a}}n and
Mathias Schacht},
title = {Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform
hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {103},
number = {6},
pages = {658--678},
year = {2013},
url = {https://doi.org/10.1016/j.jctb.2013.07.004},
doi = {10.1016/J.JCTB.2013.07.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BussHS13.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/rsa/ConlonHPS12,
author = {David Conlon and
Hi{\^{e}}p H{\`{a}}n and
Yury Person and
Mathias Schacht},
title = {Weak quasi-randomness for uniform hypergraphs},
journal = {Random Struct. Algorithms},
volume = {40},
number = {1},
pages = {1--38},
year = {2012},
url = {https://doi.org/10.1002/rsa.20389},
doi = {10.1002/RSA.20389},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ConlonHPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RodlS12,
author = {Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Complete Partite subgraphs in dense hypergraphs},
journal = {Random Struct. Algorithms},
volume = {41},
number = {4},
pages = {557--573},
year = {2012},
url = {https://doi.org/10.1002/rsa.20441},
doi = {10.1002/RSA.20441},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RodlS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KangPRSV11,
author = {Mihyun Kang and
Oleg Pikhurko and
Alexander Ravsky and
Mathias Schacht and
Oleg Verbitsky},
title = {Untangling planar graphs from a specified vertex position - Hard cases},
journal = {Discret. Appl. Math.},
volume = {159},
number = {8},
pages = {789--799},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.01.011},
doi = {10.1016/J.DAM.2011.01.011},
timestamp = {Thu, 13 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KangPRSV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/PersonS11,
author = {Yury Person and
Mathias Schacht},
title = {An expected polynomial time algorithm for coloring 2-colorable 3-graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {13},
number = {2},
pages = {1--18},
year = {2011},
url = {https://doi.org/10.46298/dmtcs.558},
doi = {10.46298/DMTCS.558},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/PersonS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BussHS11,
author = {Enno Bu{\ss} and
Hi{\^{e}}p H{\`{a}}n and
Mathias Schacht},
title = {Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform
hypergraphs},
journal = {Electron. Notes Discret. Math.},
volume = {38},
pages = {207--212},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.09.035},
doi = {10.1016/J.ENDM.2011.09.035},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BussHS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HanPS11,
author = {Hi{\^{e}}p H{\`{a}}n and
Yury Person and
Mathias Schacht},
title = {Note on forcing pairs},
journal = {Electron. Notes Discret. Math.},
volume = {38},
pages = {437--442},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.09.071},
doi = {10.1016/J.ENDM.2011.09.071},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HanPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/basesearch/Schacht10,
author = {Mathias Schacht},
title = {Regular partitions of hypergraphs and property testing},
school = {{HU} Berlin, Germany},
year = {2010},
url = {http://edoc.hu-berlin.de/18452/14627},
urn = {urn:nbn:de:kobv:11-100181885},
doi = {10.18452/13975},
timestamp = {Wed, 20 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/phd/basesearch/Schacht10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KohayakawaNRS10,
author = {Yoshiharu Kohayakawa and
Brendan Nagle and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Weak hypergraph regularity and linear hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {100},
number = {2},
pages = {151--160},
year = {2010},
url = {https://doi.org/10.1016/j.jctb.2009.05.005},
doi = {10.1016/J.JCTB.2009.05.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KohayakawaNRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HanS10,
author = {Hi{\^{e}}p H{\`{a}}n and
Mathias Schacht},
title = {Dirac-type results for loose Hamilton cycles in uniform hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {100},
number = {3},
pages = {332--346},
year = {2010},
url = {https://doi.org/10.1016/j.jctb.2009.10.002},
doi = {10.1016/J.JCTB.2009.10.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HanS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriedgutRS10,
author = {Ehud Friedgut and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Ramsey properties of random discrete structures},
journal = {Random Struct. Algorithms},
volume = {37},
number = {4},
pages = {407--436},
year = {2010},
url = {https://doi.org/10.1002/rsa.20352},
doi = {10.1002/RSA.20352},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FriedgutRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonCHKRS10,
author = {Noga Alon and
Amin Coja{-}Oghlan and
Hi{\^{e}}p H{\`{a}}n and
Mihyun Kang and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Quasi-Randomness and Algorithmic Regularity for Graphs with General
Degree Distributions},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {6},
pages = {2336--2362},
year = {2010},
url = {https://doi.org/10.1137/070709529},
doi = {10.1137/070709529},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlonCHKRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HladkyS10,
author = {Jan Hladk{\'{y}} and
Mathias Schacht},
title = {Note on Bipartite Graph Tilings},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {2},
pages = {357--362},
year = {2010},
url = {https://doi.org/10.1137/080726434},
doi = {10.1137/080726434},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HladkyS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/RodlS09,
author = {Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Generalizations of the removal lemma},
journal = {Comb.},
volume = {29},
number = {4},
pages = {467--501},
year = {2009},
url = {https://doi.org/10.1007/s00493-009-2320-x},
doi = {10.1007/S00493-009-2320-X},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/RodlS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/LefmannPRS09,
author = {Hanno Lefmann and
Yury Person and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {On Colourings of Hypergraphs Without Monochromatic Fano Planes},
journal = {Comb. Probab. Comput.},
volume = {18},
number = {5},
pages = {803--818},
year = {2009},
url = {https://doi.org/10.1017/S0963548309009948},
doi = {10.1017/S0963548309009948},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/LefmannPRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/PersonS09,
author = {Yury Person and
Mathias Schacht},
title = {An expected polynomial time algorithm for coloring 2-colorable 3-graphs},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {465--469},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.077},
doi = {10.1016/J.ENDM.2009.07.077},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/PersonS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HanPS09,
author = {Hi{\^{e}}p H{\`{a}}n and
Yury Person and
Mathias Schacht},
title = {Note on strong refutation algorithms for random k-SAT formulas},
journal = {Electron. Notes Discret. Math.},
volume = {35},
pages = {157--162},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.11.027},
doi = {10.1016/J.ENDM.2009.11.027},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HanPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HanPS09,
author = {Hi{\^{e}}p H{\`{a}}n and
Yury Person and
Mathias Schacht},
title = {On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex
Degree},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {2},
pages = {732--748},
year = {2009},
url = {https://doi.org/10.1137/080729657},
doi = {10.1137/080729657},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HanPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PersonS09,
author = {Yury Person and
Mathias Schacht},
editor = {Claire Mathieu},
title = {Almost all hypergraphs without Fano planes are bipartite},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {217--226},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.25},
doi = {10.1137/1.9781611973068.25},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/PersonS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/NaglePRS09,
author = {Brendan Nagle and
Annika Poerschke and
Vojtech R{\"{o}}dl and
Mathias Schacht},
editor = {Claire Mathieu},
title = {Hypergraph regularity and quasi-randomness},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {227--235},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.26},
doi = {10.1137/1.9781611973068.26},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/NaglePRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/NagleRS08,
author = {Brendan Nagle and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Note on the 3-graph counting lemma},
journal = {Discret. Math.},
volume = {308},
number = {19},
pages = {4501--4517},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.08.054},
doi = {10.1016/J.DISC.2007.08.054},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/NagleRS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/NagleORS08,
author = {Brendan Nagle and
Sayaka Olsen and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {On the Ramsey Number of Sparse 3-Graphs},
journal = {Graphs Comb.},
volume = {24},
number = {3},
pages = {205--228},
year = {2008},
url = {https://doi.org/10.1007/s00373-008-0784-x},
doi = {10.1007/S00373-008-0784-X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/NagleORS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BottcherST08,
author = {Julia B{\"{o}}ttcher and
Mathias Schacht and
Anusch Taraz},
title = {Spanning 3-colourable subgraphs of small bandwidth in dense graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {98},
number = {4},
pages = {752--777},
year = {2008},
url = {https://doi.org/10.1016/j.jctb.2007.11.005},
doi = {10.1016/J.JCTB.2007.11.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BottcherST08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0803-0858,
author = {Mihyun Kang and
Oleg Pikhurko and
Alexander Ravsky and
Mathias Schacht and
Oleg Verbitsky},
title = {Obfuscated Drawings of Planar Graphs},
journal = {CoRR},
volume = {abs/0803.0858},
year = {2008},
url = {http://arxiv.org/abs/0803.0858},
eprinttype = {arXiv},
eprint = {0803.0858},
timestamp = {Thu, 13 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0803-0858.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/RodlS07,
author = {Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Regular Partitions of Hypergraphs: Regularity Lemmas},
journal = {Comb. Probab. Comput.},
volume = {16},
number = {6},
pages = {833--885},
year = {2007},
url = {https://doi.org/10.1017/S0963548307008553},
doi = {10.1017/S0963548307008553},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/RodlS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/RodlS07a,
author = {Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Regular Partitions of Hypergraphs: Counting Lemmas},
journal = {Comb. Probab. Comput.},
volume = {16},
number = {6},
pages = {887--901},
year = {2007},
url = {https://doi.org/10.1017/S0963548307008565},
doi = {10.1017/S0963548307008565},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/RodlS07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BottcherST07,
author = {Julia B{\"{o}}ttcher and
Mathias Schacht and
Anusch Taraz},
title = {Embedding spanning subgraphs of small bandwidth},
journal = {Electron. Notes Discret. Math.},
volume = {29},
pages = {485--489},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.07.075},
doi = {10.1016/J.ENDM.2007.07.075},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BottcherST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/RodlSST07,
author = {Vojtech R{\"{o}}dl and
Mathias Schacht and
Mark H. Siggers and
Norihide Tokushige},
title = {Integer and fractional packings of hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {97},
number = {2},
pages = {245--268},
year = {2007},
url = {https://doi.org/10.1016/j.jctb.2006.05.006},
doi = {10.1016/J.JCTB.2006.05.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/RodlSST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KohayakawaRSSS07,
author = {Yoshiharu Kohayakawa and
Vojtech R{\"{o}}dl and
Mathias Schacht and
Papa A. Sissokho and
Jozef Skokan},
title = {Tur{\'{a}}n's theorem for pseudo-random graphs},
journal = {J. Comb. Theory, Ser. {A}},
volume = {114},
number = {4},
pages = {631--657},
year = {2007},
url = {https://doi.org/10.1016/j.jcta.2006.08.004},
doi = {10.1016/J.JCTA.2006.08.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KohayakawaRSSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AvartRS07,
author = {Christian Avart and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Every Monotone 3-Graph Property is Testable},
journal = {{SIAM} J. Discret. Math.},
volume = {21},
number = {1},
pages = {73--92},
year = {2007},
url = {https://doi.org/10.1137/060652294},
doi = {10.1137/060652294},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AvartRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RodlRS07,
author = {Vojtech R{\"{o}}dl and
Andrzej Rucinski and
Mathias Schacht},
title = {Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {21},
number = {2},
pages = {442--460},
year = {2007},
url = {https://doi.org/10.1137/060657492},
doi = {10.1137/060657492},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RodlRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlonCHKRS07,
author = {Noga Alon and
Amin Coja{-}Oghlan and
Hi{\^{e}}p H{\`{a}}n and
Mihyun Kang and
Vojtech R{\"{o}}dl and
Mathias Schacht},
editor = {Lars Arge and
Christian Cachin and
Tomasz Jurdzinski and
Andrzej Tarlecki},
title = {Quasi-randomness and Algorithmic Regularity for Graphs with General
Degree Distributions},
booktitle = {Automata, Languages and Programming, 34th International Colloquium,
{ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4596},
pages = {789--800},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73420-8\_68},
doi = {10.1007/978-3-540-73420-8\_68},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AlonCHKRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BottcherST07,
author = {Julia B{\"{o}}ttcher and
Mathias Schacht and
Anusch Taraz},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {On the bandwidth conjecture for 3-colourable graphs},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {618--626},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283450},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/BottcherST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RodlS07,
author = {Vojtech R{\"{o}}dl and
Mathias Schacht},
editor = {David S. Johnson and
Uriel Feige},
title = {Property testing in hypergraphs and the removal lemma},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {488--495},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250862},
doi = {10.1145/1250790.1250862},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RodlS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NagleRS06,
author = {Brendan Nagle and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {The counting lemma for regular \emph{k}-uniform hypergraphs},
journal = {Random Struct. Algorithms},
volume = {28},
number = {2},
pages = {113--179},
year = {2006},
url = {https://doi.org/10.1002/rsa.20117},
doi = {10.1002/RSA.20117},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/NagleRS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SchachtT05,
author = {Mathias Schacht and
Anusch Taraz},
title = {Globally bounded local edge colourings of hypergraphs},
journal = {Electron. Notes Discret. Math.},
volume = {19},
pages = {179--185},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.05.025},
doi = {10.1016/J.ENDM.2005.05.025},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/SchachtT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AvartRS05,
author = {Christian Avart and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Every Monotone 3-Graph Property is Testable},
journal = {Electron. Notes Discret. Math.},
volume = {22},
pages = {539--542},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.06.086},
doi = {10.1016/J.ENDM.2005.06.086},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/AvartRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KohayakawaRS04,
author = {Yoshiharu Kohayakawa and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {The Tur{\'{a}}n Theorem for Random Graphs},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {1},
pages = {61--91},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005856},
doi = {10.1017/S0963548303005856},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/KohayakawaRS04.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 01:25 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:
