Pages that link to "Item:Q855115"
From MaRDI portal
The following pages link to Extremal problems for transversals in graphs with bounded degree (Q855115):
Displaying 31 items.
- Two disjoint independent bases in matroid-graph pairs (Q497297) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- Extremal hypergraphs for Ryser's conjecture (Q721059) (← links)
- On \(r\)-dynamic chromatic number of graphs (Q908316) (← links)
- Complexes of directed trees and independence complexes (Q1025954) (← links)
- Problems and results in extremal combinatorics. I. (Q1417566) (← links)
- Entropy compression versus Lovász local lemma (Q2020021) (← links)
- On subgraphs of tripartite graphs (Q2092375) (← links)
- Distance \(r\)-domination number and \(r\)-independence complexes of graphs (Q2122691) (← links)
- Cooperative colorings and independent systems of representatives (Q2346466) (← links)
- Independent transversals in locally sparse graphs (Q2384801) (← links)
- Independence complexes of claw-free graphs (Q2462334) (← links)
- On factors of independent transversals in \(k\)-partite graphs (Q2665964) (← links)
- An average degree condition for independent transversals (Q2668023) (← links)
- Bounded transversals in multipartite graphs (Q2897209) (← links)
- Acyclic systems of representatives and acyclic colorings of digraphs (Q3605147) (← links)
- Fair Representation by Independent Sets (Q4604368) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- Topology of clique complexes of line graphs (Q5045261) (← links)
- On the homology of independence complexes (Q5052167) (← links)
- New bounds for the Moser‐Tardos distribution (Q5120743) (← links)
- A Density Turán Theorem (Q5272931) (← links)
- Coloring Graphs with Dense Neighborhoods (Q5495890) (← links)
- Bounding the projective dimension of a squarefree monomial ideal via domination in clutters (Q5496298) (← links)
- Complete subgraphs in a multipartite graph (Q5886355) (← links)
- Colorings, transversals, and local sparsity (Q6074708) (← links)
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)
- Graphs of low average degree without independent transversals (Q6093156) (← links)
- Chordal graphs, higher independence and vertex decomposable complexes (Q6159132) (← links)
- On an \(f\)-coloring generalization of linear arboricity of multigraphs (Q6184546) (← links)
- Packing list‐colorings (Q6185050) (← links)
