Coloring bipartite graphs with semi-small list size

DOI10.1007/s00026-022-00633-zzbMath1526.05054arXiv2008.06040OpenAlexW3048760196MaRDI QIDQ6065679

Daniel Zhu

Publication date: 15 November 2023

Published in: Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

independent setschoosabilitylist chromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Asymmetric list sizes in bipartite graphs
• A guided tour of Chernoff bounds
• The choice number of random bipartite graphs
• The list chromatic number of graphs with small clique number
• Graph colouring and the probabilistic method

This page was built for publication: Coloring bipartite graphs with semi-small list size