Independent transversals in bipartite correspondence-covers

DOI10.4153/S0008439521001004OpenAlexW3086542228MaRDI QIDQ5888915

Stijn Cambie, Ross J. Kang

Publication date: 26 April 2023

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringbipartite graphscorrespondence coloringindependent transversalsAlon-Krivelevich conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)

Related Items (2)

On triangle-free list assignments ⋮ Packing list‐colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Asymmetric list sizes in bipartite graphs
• A dense infinite Sidon sequence
• On complete subgraphs of \(r\)-chromatic graphs
• The choice number of random bipartite graphs
• Nonincident points and blocks in designs
• Large incidence-free sets in geometries
• Independent transversals in locally sparse graphs
• An average degree condition for independent transversals
• A Note on Vertex List Colouring
• Independent Transversals in Sparse Partite Hypergraphs
• Coloring triangle‐free graphs with local list sizes
• The Johansson‐Molloy theorem for DP‐coloring
• A note on group colorings

This page was built for publication: Independent transversals in bipartite correspondence-covers