A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree

Tom Kelly; Daniela Kühn; Deryk Osthus

doi:10.1017/S0963548323000299

A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree

Tom Kelly^*
, Daniela Kühn
, Deryk Osthus

^*Corresponding author for this work

Mathematics

Research output: Contribution to journal › Article › peer-review

94 Downloads (Pure)

Original language	English
Pages (from-to)	1-17
Journal	Combinatorics, Probability and Computing
Early online date	10 Nov 2023
DOIs	https://doi.org/10.1017/S0963548323000299
Publication status	E-pub ahead of print - 10 Nov 2023

Keywords

Graph colouring
colour degrees
edge-colouring
hypergraphs
probabilistic method
nibble

Access to Document

10.1017/S0963548323000299Licence: Creative Commons: Attribution (CC BY)

KellyT2023ASpecialFinal published version, 332 KBLicence: Creative Commons: Attribution (CC BY)

https://www.cambridge.org/core/product/identifier/S0963548323000299/type/journal_article

Approximate Structure in Large Graphs and Hypergraphs
Osthus, D. (Principal Investigator)
Engineering & Physical Science Research Council
1/01/19 → 31/12/21
Project: Research Councils
H2020_ERC_EXTCOMB
Osthus, D. (Co-Investigator) & Kuhn, D. (Principal Investigator)
European Commission
1/01/19 → 31/12/24
Project: EU
Combinatorics, Probability and Algorithms: Fellowship, Establish Career: Professor D Kuhn
Kuhn, D. (Principal Investigator)
Engineering & Physical Science Research Council
1/09/16 → 31/08/21
Project: Research Councils

Cite this

@article{41df664b1a834478832ac3c560461441,

title = "A special case of Vu{\textquoteright}s conjecture: colouring nearly disjoint graphs of bounded maximum degree",

keywords = "Graph colouring, colour degrees, edge-colouring, hypergraphs, probabilistic method, nibble",

author = "Tom Kelly and Daniela K{\"u}hn and Deryk Osthus",

year = "2023",

month = nov,

day = "10",

doi = "10.1017/S0963548323000299",

language = "English",

pages = "1--17",

journal = "Combinatorics, Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

}

TY - JOUR

T1 - A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree

AU - Kelly, Tom

AU - Kühn, Daniela

AU - Osthus, Deryk

PY - 2023/11/10

Y1 - 2023/11/10

KW - Graph colouring

KW - colour degrees

KW - edge-colouring

KW - hypergraphs

KW - probabilistic method

KW - nibble

U2 - 10.1017/S0963548323000299

DO - 10.1017/S0963548323000299

M3 - Article

SN - 0963-5483

SP - 1

EP - 17

JO - Combinatorics, Probability and Computing

JF - Combinatorics, Probability and Computing

ER -

A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree

Keywords

Access to Document

Projects

Approximate Structure in Large Graphs and Hypergraphs

H2020_ERC_EXTCOMB

Combinatorics, Probability and Algorithms: Fellowship, Establish Career: Professor D Kuhn

Cite this