Independent transversals in locally sparse graphs
From MaRDI portal
Publication:2384801
DOI10.1016/j.jctb.2007.02.003zbMath1125.05040arXiv0706.2124OpenAlexW2133232693MaRDI QIDQ2384801
Publication date: 10 October 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0706.2124
Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)
Related Items (12)
Independent transversals in bipartite correspondence-covers ⋮ An average degree condition for independent transversals ⋮ A General Framework for Hypergraph Coloring ⋮ Colorings, transversals, and local sparsity ⋮ Graphs of low average degree without independent transversals ⋮ Cooperative colorings of forests ⋮ Packing list‐colorings ⋮ New bounds for the Moser‐Tardos distribution ⋮ Polynomial treewidth forces a large grid-like-minor ⋮ Independent coverings and orthogonal colourings ⋮ Cooperative colorings of trees and of bipartite graphs ⋮ Cooperative colorings and independent systems of representatives
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal problems for transversals in graphs with bounded degree
- The linear arboricity of graphs
- On complete subgraphs of \(r\)-chromatic graphs
- Independent transversals in \(r\)-partite graphs
- Domination numbers and homology
- Problems and results in extremal combinatorics. I.
- Asymptotically the list colouring constants are 1
- Independent systems of representatives in weighted graphs
- A Note on Vertex List Colouring
- Odd Independent Transversals are Odd
- The strong chromatic number of a graph
- Complete Subgraphs of r-partite Graphs
- On the Strong Chromatic Number
- On a list coloring conjecture of Reed
- Graph colouring and the probabilistic method
This page was built for publication: Independent transversals in locally sparse graphs
