Matroid matching with Dilworth truncation

DOI10.1016/j.disc.2007.07.076zbMath1139.05011OpenAlexW1967991534MaRDI QIDQ2476281

Márton Makai

Publication date: 18 March 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01184349/file/dmAE0135.pdf

zbMATH Keywords

matroid matchingDilworth truncationdouble circuit property

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some combinatorial properties of algebraic matroids
• An augmenting path algorithm for linear matroid parity
• Matroid matching and some applications
• The weak series reduction property implies pseudomodularity
• The linear delta-matroid parity problem
• Matroid matching in pseudomodular lattices
• Solving the linear matroid parity problem as a sequence of matroid intersection problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Matroid matching via mixed skew-symmetric matrices
• On graphs and rigidity of plane skeletal structures
• Complexity of Matroid Property Algorithms
• A new characterization of the maximum genus of a graph
• On Generic Rigidity in the Plane

This page was built for publication: Matroid matching with Dilworth truncation