Colorings, transversals, and local sparsity

DOI10.1002/rsa.21051zbMath1522.05493arXiv2003.05233MaRDI QIDQ6074708

Tom Kelly, Ross J. Kang

Publication date: 12 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.05233

zbMATH Keywords

list coloringcorrespondence coloringindependent transversalsconflict choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)

Related Items (3)

A General Framework for Hypergraph Coloring ⋮ Graphs of low average degree without independent transversals ⋮ Packing list‐colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 5-list-coloring planar graphs with distant precolored vertices
• Colouring graphs when the number of colours is almost the maximum degree
• Extremal problems for transversals in graphs with bounded degree
• The linear arboricity of graphs
• On complete subgraphs of \(r\)-chromatic graphs
• Asymptotically the list colouring constants are 1
• A condition for matchability in hypergraphs
• Concentration of measure and isoperimetric inequalities in product spaces
• The local cut lemma
• Independent transversals in locally sparse graphs
• A Note on Vertex List Colouring
• Independent Transversals in Sparse Partite Hypergraphs
• A Stronger Bound for the Strong Chromatic Index
• An asymptotically tight bound on the adaptable chromatic number
• Transversals of Vertex Partitions in Graphs
• On a list coloring conjecture of Reed
• A local epsilon version of Reed's conjecture
• Single‐conflict colouring

This page was built for publication: Colorings, transversals, and local sparsity