A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree
From MaRDI portal
Publication:6632801
DOI10.1017/S0963548323000299MaRDI QIDQ6632801
Tom Kelly, Deryk Osthus, Daniela Kühn
Publication date: 5 November 2024
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic behavior of the chromatic index for hypergraphs
- On the combinatorial problems which I would most like to see solved
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- Asymptotically the list colouring constants are 1
- Asymptotically good list-colorings
- Concentration of measure and isoperimetric inequalities in product spaces
- An average degree condition for independent transversals
- A note on vertex list colouring
- A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
- Near-optimal list colorings
- A Stronger Bound for the Strong Chromatic Index
- On a list coloring conjecture of Reed
- Colouring graphs with forbidden bipartite subgraphs
- Independent transversals in bipartite correspondence-covers
- Graph colouring and the probabilistic method
- Asymptotically good edge correspondence colourings
- Graph and hypergraph colouring via nibble methods: a survey
- A proof of the Erdős-Faber-Lovász conjecture
Related Items (1)
This page was built for publication: A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632801)
