Constructing graphs with no independent transversals
From MaRDI portal
Publication:6574378
DOI10.37236/12429zbMath1543.05188MaRDI QIDQ6574378
Ronen Wdowinski, Penny E. Haxell
Publication date: 18 July 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal problems for transversals in graphs with bounded degree
- The circular chromatic index of graphs of high girth
- The clique complex and hypergraph matching
- The linear arboricity of graphs
- A solution to a colouring problem of P. Erdős
- On complete subgraphs of \(r\)-chromatic graphs
- The Hamiltonian property of consecutive-\(d\) digraphs
- Probabilistic methods in coloring and decomposition problems
- Independent transversals in \(r\)-partite graphs
- Domination numbers and homology
- Bounded size components -- partitions and transversals.
- Problems and results in extremal combinatorics. I.
- Asymptotically the list colouring constants are 1
- Triangulated spheres and colored cliques
- A tree version of Kőnig's theorem
- A condition for matchability in hypergraphs
- Cooperative colorings and independent systems of representatives
- Independent transversals in locally sparse graphs
- Sets of elements that pairwise generate a linear group
- Independent systems of representatives in weighted graphs
- An average degree condition for independent transversals
- A Note on Vertex List Colouring
- Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes
- Bounded transversals in multipartite graphs
- On Forming Committees
- Santa claus meets hypergraph matchings
- Odd Independent Transversals are Odd
- The intersection of a matroid and a simplicial complex
- Adapted List Coloring of Graphs and Hypergraphs
- Complete Subgraphs of r-partite Graphs
- Hall's theorem for hypergraphs
- On a list coloring conjecture of Reed
- Finding independent transversals efficiently
- A General Framework for Hypergraph Coloring
- Topological connectedness and independent sets in graphs
- Single‐conflict colouring
- Colorings, transversals, and local sparsity
- Graphs of low average degree without independent transversals
- Degree criteria and stability for independent transversals
- Improved integrality gap in max-min allocation: or topology at the north pole
- A precise condition for independent transversals in bipartite covers
This page was built for publication: Constructing graphs with no independent transversals
