Partitioning into common independent sets via relaxing strongly base orderability

DOI10.1016/j.jcta.2023.105817arXiv2302.01445OpenAlexW4386951525MaRDI QIDQ6144384

Publication date: 29 January 2024

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.01445

zbMATH Keywords

coverings excluded minors matroid intersection strongly base orderable matroids matroidally \(k\)-colorability

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
The edge covering number of the intersection of two matroids
Bases-cobases graphs and polytopes of matroids
An infinite family of excluded minors for strong base-orderability
A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
Ordering of the elements of a matroid such that its consecutive w elements are independent
A solution to a colouring problem of P. Erdős
The Hamiltonian property of consecutive-\(d\) digraphs
On the relations of various conjectures on Latin squares and straightening coefficients
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Basis-exchange properties of sparse paving matroids
Complexity of packing common bases in matroids
On the impossibility of decomposing binary matroids
On partitioning two matroids into common independent subsets
On Circuits and Serial Symmetric Basis-Exchange in Matroids
The intersection of a matroid and a simplicial complex
Decomposing symmetric exchanges in matroid bases
Disjoint Common Transversals and Exchange Structures
A COMPLETE CLASS OF MATROIDS
On the Strong Chromatic Number
List Coloring of Two Matroids through Reduction to Partition Matroids
On Serial Symmetric Exchanges of Matroid Bases
Transversals and matroid partition
Optimum branchings
Comments on bases in dependence structures
A Combinatorial Model for Series-Parallel Networks
On Packing Dijoins in Digraphs and Weighted Digraphs
Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings

This page was built for publication: Partitioning into common independent sets via relaxing strongly base orderability