📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree (2021)

First Author: Kelly T

Attributed to: Combinatorics, Probability and Algorithms funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.2109.11438

Publication URI: https://arxiv.org/abs/2109.11438

Type: Preprint