Max-flow min-cut theorem

Summary

Max-flow min-cut theorem is a theorem^[1]. It ranks in the top 9% of theorem entities by monthly Wikipedia readership (169 views/month).^[2]

Key Facts

• Max-flow min-cut theorem's instance of is recorded as theorem^[3].
• Max-flow min-cut theorem's part of is recorded as list of theorems^[4].
• Max-flow min-cut theorem's has use is recorded as flow network^[5].
• Max-flow min-cut theorem's Freebase ID is recorded as /m/0kf5h^[6].
• Max-flow min-cut theorem's statement describes is recorded as flow network^[7].
• Max-flow min-cut theorem's statement describes is recorded as minimum cut^[8].
• Max-flow min-cut theorem's MathWorld ID is recorded as MaximumFlowMinimumCutTheorem^[9].
• Max-flow min-cut theorem's maintained by WikiProject is recorded as WikiProject Mathematics^[10].
• Max-flow min-cut theorem's Microsoft Academic ID is recorded as 36740117^[11].
• Max-flow min-cut theorem's Brilliant Wiki ID is recorded as max-flow-min-cut-algorithm^[12].

Why It Matters

Max-flow min-cut theorem ranks in the top 9% of theorem entities by monthly Wikipedia readership (169 views/month).^[2] It has Wikipedia articles in 17 language editions, a strong signal of global cultural recognition.^[13] It is known by 5 alternative names across languages and contexts.^[14]