Asymptotically good edge correspondence colouring

2018/08/26 by Michael Molloy, Molloy, Michael, Postle, Luke · 3 citations
Mathematics · Computer Science · Engineering · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1808.08594

Abstract

We prove that every simple graph with maximum degree Δ has an edge correspondence colouring with Δ+o(Δ) colours.

Cited by

• Partial DP-Coloring
• A special case of Vu's conjecture: Coloring nearly disjoint graphs of\n bounded maximum degree
• On the Chromatic Polynomial and Counting DP-Colorings

Related

• Tools for parsimonious edge-colouring of graphs with maximum degree three
• Simultaneous edge-colourings
• Strong edge-colouring of sparse planar graphs
• δ^(k)-Colouring of Cycle Related Graphs
• Strong edge-colouring via local flag algebras