Pages that link to "Item:Q3420348"
From MaRDI portal
The following pages link to The intersection of a matroid and a simplicial complex (Q3420348):
Displaying 38 items.
- Two disjoint independent bases in matroid-graph pairs (Q497297) (← links)
- A variation on the homological nerve theorem (Q529097) (← links)
- The edge covering number of the intersection of two matroids (Q658021) (← links)
- ``What is a complex matroid?'' (Q688014) (← links)
- Extremal hypergraphs for Ryser's conjecture (Q721059) (← links)
- Minors of simplicial complexes (Q967303) (← links)
- Coloring by two-way independent sets (Q1044959) (← links)
- Fair representation in dimatroids (Q1689871) (← links)
- Decomposing a graph into forests and a matching (Q1748265) (← links)
- Rainbow simplices in triangulations of manifolds (Q1999728) (← links)
- Different versions of the nerve theorem and colourful simplices (Q2010622) (← links)
- On the impossibility of decomposing binary matroids (Q2084049) (← links)
- Rainbow and monochromatic circuits and cocircuits in binary matroids (Q2124622) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- Cooperative colorings of trees and of bipartite graphs (Q2294110) (← links)
- Fair representation in the intersection of two matroids (Q2409842) (← links)
- A generalized-polymatroid approach to disjoint common independent sets in two matroids (Q2421866) (← links)
- A note on the edge cover number and independence number in hypergraphs (Q2427533) (← links)
- A note on interconnecting matchings in graphs (Q2509302) (← links)
- The matroid intersection cover problem (Q2661583) (← links)
- On the complexity of packing rainbow spanning trees (Q2685331) (← links)
- A geometric Hall-type theorem (Q2789848) (← links)
- Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes (Q2833255) (← links)
- On a Generalization of the Ryser-Brualdi-Stein Conjecture (Q2940993) (← links)
- Acyclic systems of representatives and acyclic colorings of digraphs (Q3605147) (← links)
- A Stability Theorem for Matchings in Tripartite 3-Graphs (Q4962591) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- List Coloring of Two Matroids through Reduction to Partition Matroids (Q5157385) (← links)
- Helly-type problems (Q5868651) (← links)
- Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
- Multipartite hypergraphs achieving equality in Ryser's conjecture (Q5964971) (← links)
- Graphs of low average degree without independent transversals (Q6093156) (← links)
- Choice functions (Q6105041) (← links)
- Stability of the Levi-Civita tensors and an Alon-Tarsi type theorem (Q6122518) (← links)
- Extensions of the colorful Helly theorem for <i>d</i>-collapsible and <i>d</i>-Leray complexes (Q6131055) (← links)
- Partitioning into common independent sets via relaxing strongly base orderability (Q6144384) (← links)
- Constructing graphs with no independent transversals (Q6574378) (← links)
- Rota's basis conjecture holds for random bases of vector spaces (Q6612512) (← links)
