Asymptotically good edge correspondence colouring
Combinatorics
2022-01-03 v4
Abstract
We prove that every simple graph with maximum degree has an edge correspondence colouring with colours.
Keywords
Cite
@article{arxiv.1808.08594,
title = {Asymptotically good edge correspondence colouring},
author = {Michael Molloy and Luke Postle},
journal= {arXiv preprint arXiv:1808.08594},
year = {2022}
}