The intersection of a matroid and a simplicial complex

DOI10.1090/S0002-9947-06-03833-5zbMath1108.05023OpenAlexW1558934860MaRDI QIDQ3420348

Ron Aharoni, Eli Berger

Publication date: 1 February 2007

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-06-03833-5

zbMATH Keywords

topologyRyser's conjectureRota's conjectureEdmonds' theorem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Rainbow and monochromatic circuits and cocircuits in binary matroids, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, The matroid intersection cover problem, On a Generalization of the Ryser-Brualdi-Stein Conjecture, Fair representation in the intersection of two matroids, Fair representation in dimatroids, A generalized-polymatroid approach to disjoint common independent sets in two matroids, Graphs of low average degree without independent transversals, Choice functions, Stability of the Levi-Civita tensors and an Alon-Tarsi type theorem, Extensions of the colorful Helly theorem for d-collapsible and d-Leray complexes, On the complexity of packing rainbow spanning trees, Partitioning into common independent sets via relaxing strongly base orderability, A note on the edge cover number and independence number in hypergraphs, The edge covering number of the intersection of two matroids, Two disjoint independent bases in matroid-graph pairs, List Coloring of Two Matroids through Reduction to Partition Matroids, Decomposing a graph into forests and a matching, A variation on the homological nerve theorem, Rainbow simplices in triangulations of manifolds, Minors of simplicial complexes, Different versions of the nerve theorem and colourful simplices, A geometric Hall-type theorem, Extremal hypergraphs for Ryser's conjecture, Acyclic systems of representatives and acyclic colorings of digraphs, A note on interconnecting matchings in graphs, Multipartite hypergraphs achieving equality in Ryser's conjecture, Cooperative colorings of trees and of bipartite graphs, A Stability Theorem for Matchings in Tripartite 3-Graphs, Approximate multi-matroid intersection via iterative refinement, Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes, Finding independent transversals efficiently, Coloring by two-way independent sets, On the impossibility of decomposing binary matroids, Helly-type problems

Cites Work

• Unnamed Item
• Ryser's conjecture for tripartite 3-graphs
• The clique complex and hypergraph matching
• Homotopy properties of greedoids
• A solution to a colouring problem of P. Erdős
• On Rota's problem about \(n\) bases in a rank \(n\) matroid
• Independent transversals in \(r\)-partite graphs
• Domination numbers and homology
• Triangulated spheres and colored cliques
• A tree version of Kőnig's theorem
• A condition for matchability in hypergraphs
• Independent systems of representatives in weighted graphs
• Matroid Intersection
• A weighted matroid intersection algorithm
• Disjoint Common Transversals and Exchange Structures
• The Intersection of Two Infinite Matroids
• Hall's theorem for hypergraphs
• On the Strong Chromatic Number
• On Representatives of Subsets
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• On Matroid Theorems of Edmonds and Rado