Constructing graphs with no independent transversals
From MaRDI portal
Publication:6574378
Recommendations
Cites work
- scientific article; zbMATH DE number 25254 (Why is no real title available?)
- scientific article; zbMATH DE number 1299964 (Why is no real title available?)
- scientific article; zbMATH DE number 524136 (Why is no real title available?)
- A condition for matchability in hypergraphs
- A general framework for hypergraph coloring
- A note on vertex list colouring
- A precise condition for independent transversals in bipartite covers
- A solution to a colouring problem of P. Erdős
- A tree version of Kőnig's theorem
- Adapted List Coloring of Graphs and Hypergraphs
- An average degree condition for independent transversals
- Asymptotically the list colouring constants are 1
- Bounded size components -- partitions and transversals.
- Bounded transversals in multipartite graphs
- Colorings, transversals, and local sparsity
- Complete Subgraphs of r-partite Graphs
- Cooperative colorings and independent systems of representatives
- Degree criteria and stability for independent transversals
- Domination numbers and homology
- Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes
- Extremal problems for transversals in graphs with bounded degree
- Finding independent transversals efficiently
- Graphs of low average degree without independent transversals
- Hall's theorem for hypergraphs
- Improved integrality gap in max-min allocation: or topology at the north pole
- Independent systems of representatives in weighted graphs
- Independent transversals in \(r\)-partite graphs
- Independent transversals in locally sparse graphs
- Odd Independent Transversals are Odd
- On Forming Committees
- On a list coloring conjecture of Reed
- On complete subgraphs of r-chromatic graphs
- Probabilistic methods in coloring and decomposition problems
- Problems and results in extremal combinatorics. I.
- Santa claus meets hypergraph matchings
- Sets of elements that pairwise generate a linear group
- Single‐conflict colouring
- The Hamiltonian property of consecutive-\(d\) digraphs
- The circular chromatic index of graphs of high girth
- The clique complex and hypergraph matching
- The intersection of a matroid and a simplicial complex
- The linear arboricity of graphs
- Topological connectedness and independent sets in graphs
- Triangulated spheres and colored cliques
Cited in
(4)
This page was built for publication: Constructing graphs with no independent transversals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574378)
