Disjoint Common Transversals and Exchange Structures

DOI10.1112/jlms/s2-14.1.55zbMath0366.05001OpenAlexW2009551324MaRDI QIDQ4140998

Joan Davies, Colin J. H. McDiarmid

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1112/jlms/s2-14.1.55

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (20)

Compatible systems of representatives ⋮ Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs ⋮ On Packing Dijoins in Digraphs and Weighted Digraphs ⋮ A generalized-polymatroid approach to disjoint common independent sets in two matroids ⋮ The \(b\)-branching problem in digraphs ⋮ Shifted matroid optimization ⋮ Partitioning into common independent sets via relaxing strongly base orderability ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the toric ideal of a matroid ⋮ List Coloring of Two Matroids through Reduction to Partition Matroids ⋮ Complexity of packing common bases in matroids ⋮ Approximations for the disjoint paths problem in high-diameter planar networks ⋮ Adjacency, inseparability, and base orderability in matroids ⋮ An algorithm for packing connectors ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ Integral decomposition in polyhedra ⋮ The intersection of a matroid and a simplicial complex ⋮ On partitioning two matroids into common independent subsets ⋮ Market Pricing for Matroid Rank Valuations

This page was built for publication: Disjoint Common Transversals and Exchange Structures