A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree (Q6632801)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree |
scientific article; zbMATH DE number 7938720
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree |
scientific article; zbMATH DE number 7938720 |
Statements
A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree (English)
0 references
5 November 2024
0 references
graph colouring
0 references
colour degrees
0 references
edge-colouring
0 references
hypergraphs
0 references
probabilistic method
0 references
nibble
0 references
