A note on maxflow-mincut and homomorphic equivalence in matroids

DOI10.1023/A:1011268025029zbMath0966.05015OpenAlexW1487715510MaRDI QIDQ1840660

Winfried Hochstättler, Jaroslav Nešetřil

Publication date: 16 August 2001

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011268025029

zbMATH Keywords

matroidsMenger's theoremhomomorphism dualitystrong mapsmaxflow-mincut duality

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

A surprising permanence of old motivations (a not-so-rigid story)

Cites Work

• The matroids with the max-flow min-cut property
• On classes of relations and graphs determined by subobjects and factorobjects
• Some new good characterizations for directed graphs
• Duality and Polynomial Testing of Tree Homomorphisms
• Theory of Matroids
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on maxflow-mincut and homomorphic equivalence in matroids