On a classification of independence systems

DOI10.1016/0166-218X(80)90033-5zbMath0449.90072OpenAlexW2080852062MaRDI QIDQ5904597

Reinhardt Euler

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0166-218x(80)90033-5

zbMATH Keywords

combinatorial optimizationindependence systemsk- matroid intersectionmatchoidmatroid axiomaticstravelling salesman problemsvertex packing in finite graphs

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Regular (2, 2)-systems

Cites Work

• Unnamed Item
• Unnamed Item
• On maximal independent sets of vertices in claw-free graphs
• Transversal theory. An account of some aspects of combinatorial mathematics