Extremal Combinatorics: existence, counting and typical structure

Project Information

ExtComb

Grant agreement ID: 786198

DOI

10.3030/786198

Project closed

EC signature date 2 May 2018

Start date 1 January 2019

End date 31 December 2024

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 797 111,21

EU contribution

€ 1 797 111,00

Coordinated by

THE UNIVERSITY OF BIRMINGHAM
United Kingdom

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Conference proceedings (1)

Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles

Author(s): Allan Lo, Vincent Pfenninger
Published in: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 2023, Page(s) 725-730
Publisher: Masaryk University Press
DOI: 10.5817/cz.muni.eurocomb23-100

Peer reviewed articles (14)

Almost all optimally coloured complete graphs contain a rainbow Hamilton path

Author(s): Stephen Gould; Tom Kelly; Daniela Kühn; Deryk Osthus
Published in: Journal of Combinatorial Theory, Series B, 2022, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2022.04.003

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
Publisher: Cambridge University Press
DOI: 10.1017/s0963548320000619

New bounds on the size of nearly perfect matchings in almost regular hypergraphs

Author(s): Dong Yeap Kang, Daniela Khn, Abhishek Methuku, Deryk Osthus
Published in: Journal of the London Mathematical Society, Issue 108, 2023, Page(s) 1701-1746, ISSN 0024-6107
Publisher: Oxford University Press
DOI: 10.1112/jlms.12792

Path decompositions of tournaments

Author(s): Girão, António; Granet, Bertille; Kühn, Daniela; Lo, Allan; Osthus, Deryk
Published in: Proceedings of the London Mathematical Society, 2023, ISSN 1460-244X
Publisher: Wiley
DOI: 10.1112/plms.12480

Hamiltonicity of graphs perturbed by a random regular graph

Author(s): Alberto Espuny Díaz; António Girão
Published in: Randon Structures Algorithms, 2023, Page(s) 857-886, ISSN 1098-2418
Publisher: Wiley
DOI: 10.48550/arxiv.2101.06689

On $3$-uniform hypergraphs avoiding a cycle of length four

Author(s): Beka Ergemlidze, Ervin Győri, Abhishek Methuku, Nika Salia, Casey Tompkins
Published in: The Electronic Journal of Combinatorics, Issue 30, 2023, ISSN 1077-8926
Publisher: Electronic Journal of Combinatorics
DOI: 10.37236/11443

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
Publisher: Oxford University Press
DOI: 10.1112/jlms.12455

A proof of the Erds--Faber--Lovsz conjecture

Author(s): Dong Kang, Tom Kelly, Daniela Khn, Abhishek Methuku, Deryk Osthus
Published in: Annals of Mathematics, Issue 198, 2023, Page(s) 537-618, ISSN 0003-486X
Publisher: Princeton University Press
DOI: 10.4007/annals.2023.198.2.2

Perfect Matchings in Random Sparsifications of Dirac Hypergraphs

Author(s): Dong Yeap Kang, Tom Kelly, Daniela Khn, Deryk Osthus, Vincent Pfenninger
Published in: Combinatorica, Issue 44, 2024, Page(s) 1233-1266, ISSN 0209-9683
Publisher: Springer Verlag
DOI: 10.1007/s00493-024-00116-0

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
Publisher: Cambridge University Press
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
Publisher: Academic Press
DOI: 10.1016/j.jctb.2020.03.002

Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor

Author(s): Kang, Dong Yeap; Kelly, Tom; Kühn, Daniela; Methuku, Abhishek; Osthus, Deryk
Published in: Transactions of the American Mathematical Society, 2023, ISSN 0002-9947
Publisher: American Mathematical Society
DOI: 10.1090/tran/8954

Solution to a problem of Erdos on the chromatic index of hypergraphs with bounded codegree

Author(s): Dong-yeap Kang, Tom Kelly, Daniela Kuhn, Abhishek Methuku, Deryk Osthus
Published in: Proceedings of the London Mathematical Society, 2024, ISSN 1460-244X
Publisher: Wiley
DOI: 10.1112/plms.70011

A proof of the ElliottRdl conjecture on hypertrees in Steiner triple systems

Author(s): Seonghyuk Im, Jaehoon Kim, Joonkyung Lee, Abhishek Methuku
Published in: Forum of Mathematics, Sigma, Issue 12, 2024, ISSN 2050-5094
Publisher: Cambridge University Press
DOI: 10.1017/fms.2024.34

Book chapters (3)

Graph and hypergraph colouring via nibble methods: A survey

Author(s): Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
Published in: European Congress of Mathematics, 2024, Page(s) 771-823
Publisher: EMS Press
DOI: 10.4171/8ecm/11

Path Decompositions of Random Directed Graphs

Author(s): Alberto Espuny Díaz, Viresh Patel, Fabian Stroh
Published in: Trends in Mathematics, Extended Abstracts EuroComb 2021, 2021, Page(s) 702-706
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-83823-2_112

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, ISBN 978-1-61197-646-5
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.56