An average degree condition for independent transversals

DOI10.1016/j.jctb.2022.01.004zbMath1483.05197arXiv2003.01683OpenAlexW4210330004MaRDI QIDQ2668023

Stefan Glock, Benjamin Sudakov

Publication date: 3 March 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

locally sparse graphindependent transversal

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)

Related Items

Independent transversals in bipartite correspondence-covers ⋮ 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
• Unnamed Item
• Unnamed Item
• Extremal problems for transversals in graphs with bounded degree
• The linear arboricity of graphs
• A new result on the problem of Zarankiewicz
• On complete subgraphs of \(r\)-chromatic graphs
• Norm-graphs: Variations and applications
• Independent transversals in \(r\)-partite graphs
• Domination numbers and homology
• Asymptotically the list colouring constants are 1
• New asymptotics for bipartite Turán numbers
• Independent transversals in locally sparse graphs
• Independent systems of representatives in weighted graphs
• Norm-graphs and bipartite Turán numbers
• A Note on Vertex List Colouring
• Independent transversals and hypergraph matchings - an elementary approach
• Independent Transversals and Independent Coverings in Sparse Partite Graphs
• The strong chromatic number of a graph
• Complete Subgraphs of r-partite Graphs
• Independent Transversals in Sparse Partite Hypergraphs
• On the Strong Chromatic Number
• On a list coloring conjecture of Reed
• On Graphs that do not Contain a Thomsen Graph
• On a problem of K. Zarankiewicz
• Graph colouring and the probabilistic method