Disjoint Common Transversals and Exchange Structures

DOI10.1112/JLMS/S2-14.1.55MaRDI QIDQ4140998zbMATH OpenOpenAlexFDO

Authors Joan Davies, Colin 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)

Cited in

(20)

• Approximations for the disjoint paths problem in high-diameter planar networks
• Compatible systems of representatives
• Adjacency, inseparability, and base orderability in matroids
• An algorithm for packing connectors
• Shifted matroid optimization
• Combinatorial analysis. (Matrix problems, choice theory)
• Complexity of packing common bases in matroids
• The \(b\)-branching problem in digraphs
• A generalized-polymatroid approach to disjoint common independent sets in two matroids
• On the toric ideal of a matroid
• On partitioning two matroids into common independent subsets
• The intersection of a matroid and a simplicial complex
• Integral decomposition in polyhedra
• scientific article; zbMATH DE number 7378329 (Why is no real title available?)
• Market pricing for matroid rank valuations
• List coloring of two matroids through reduction to partition matroids
• Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
• On Packing Dijoins in Digraphs and Weighted Digraphs
• scientific article; zbMATH DE number 7765397 (Why is no real title available?)
• Partitioning into common independent sets via relaxing strongly base orderability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140998)