Two disjoint independent bases in matroid-graph pairs

DOI10.1007/s00373-014-1439-8zbMath1321.05035OpenAlexW1964090655MaRDI QIDQ497297

Ron Aharoni, Eli Berger, Philipp Sprüssel

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1439-8

zbMATH Keywords

disjoint bases of matroidsindependent systems of representativesstrong coloring conjecture

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a lower bound for the connectivity of the independence complex of a graph
• Extremal problems for transversals in graphs with bounded degree
• The clique complex and hypergraph matching
• Independent transversals in \(r\)-partite graphs
• Domination numbers and homology
• Triangulated spheres and colored cliques
• A condition for matchability in hypergraphs
• Independent systems of representatives in weighted graphs
• Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes
• The Geometry of Musical Chords
• The intersection of a matroid and a simplicial complex
• An improved bound for the strong chromatic number
• Complete Subgraphs of r-partite Graphs
• On the Strong Chromatic Number

This page was built for publication: Two disjoint independent bases in matroid-graph pairs