Skip to main content

Extremal Combinatorics: existence, counting and typical structure

Searching for OpenAIRE data...

Publications

Counting Hamilton cycles in Dirac hypergraphs

Author(s): Stefan Glock, Stephen Gould, Felix Joos, Daniela Kühn, Deryk Osthus
Published in: Combinatorics, Probability and Computing, Issue 30/4, 2021, Page(s) 631-653, ISSN 0963-5483
DOI: 10.1017/s0963548320000619

Path and cycle decompositions of dense graphs

Author(s): António Girão, Bertille Granet, Daniela Kühn, Deryk Osthus
Published in: Journal of the London Mathematical Society, 2021, ISSN 0024-6107
DOI: 10.1112/jlms.12455

Dirac’s theorem for random regular graphs

Author(s): Padraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus
Published in: Combinatorics, Probability and Computing, Issue 30/1, 2021, Page(s) 17-36, ISSN 0963-5483
DOI: 10.1017/s0963548320000346

Decompositions into isomorphic rainbow spanning trees

Author(s): Stefan Glock, Daniela Kühn, Richard Montgomery, Deryk Osthus
Published in: Journal of Combinatorial Theory, Series B, 2020, ISSN 0095-8956
DOI: 10.1016/j.jctb.2020.03.002

Hamiltonicity of random subgraphs of the hypercube

Author(s): Padraig Condon, Alberto Espuny Díaz, Antonio Girão, Daniela Kühn, Deryk Osthus
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 889-898
DOI: 10.1137/1.9781611976465.56