A Short Proof of Ore’s f-Factor Theorem Using Flows

DOI10.1007/978-981-19-7014-6_12zbMath1530.05154MaRDI QIDQ6193840

Sriraman Sridharan, Patrick Vilamajó

Publication date: 13 February 2024

Published in: Synergies in Analysis, Discrete Mathematics, Soft Computing and Modelling (Search for Journal in Brave)

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• A theorem on flows in networks
• Spanning subgraphs with specified valencies
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Short Proof of Ore’s f-Factor Theorem Using Flows