Extremal problems for transversals in graphs with bounded degree
From MaRDI portal
Publication:855115
DOI10.1007/S00493-006-0019-9zbMATH Open1106.05100OpenAlexW2067487847MaRDI QIDQ855115FDOQ855115
Publication date: 2 January 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/24692
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Transversal (matching) theory (05D15)
Cited In (34)
- An Extremal Graph Problem with a Transcendental Solution
- Bounded transversals in multipartite graphs
- Constructing graphs with no independent transversals
- Entropy compression versus Lovász local lemma
- Graphs of low average degree without independent transversals
- Distance \(r\)-domination number and \(r\)-independence complexes of graphs
- Colorings, transversals, and local sparsity
- On factors of independent transversals in \(k\)-partite graphs
- Independent transversals in locally sparse graphs
- New bounds for the Moser‐Tardos distribution
- Polynomial treewidth forces a large grid-like-minor
- Fair Representation by Independent Sets
- On \(r\)-dynamic chromatic number of graphs
- Complexes of directed trees and independence complexes
- Extremal hypergraphs for Ryser's conjecture
- On the homology of independence complexes
- Problems and results in extremal combinatorics. I.
- On an \(f\)-coloring generalization of linear arboricity of multigraphs
- Packing list‐colorings
- Independence complexes of claw-free graphs
- Coloring Graphs with Dense Neighborhoods
- A Density Turán Theorem
- Bounding the projective dimension of a squarefree monomial ideal via domination in clutters
- Chordal graphs, higher independence and vertex decomposable complexes
- An average degree condition for independent transversals
- Topology of clique complexes of line graphs
- Complete subgraphs in a multipartite graph
- Two disjoint independent bases in matroid-graph pairs
- Cooperative colorings and independent systems of representatives
- Acyclic systems of representatives and acyclic colorings of digraphs
- A precise condition for independent transversals in bipartite covers
- Finding independent transversals efficiently
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel
- On subgraphs of tripartite graphs
This page was built for publication: Extremal problems for transversals in graphs with bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855115)