# OCME ยท Knowledge & practice explorer 302 MKO / 1,441 families / 360 batches / 36,000 questions. 36,000 second-context math/bilingual reviewed; 0 display/symbol-checked candidates. Source questions: candidate. English: ai_candidate. No new proof, Lean, SREG or training. 100 results; page 1/4. ## Question 25901: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0001`; number: 25901 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0001/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0001/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0001.json) ## Question 25902: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0002`; number: 25902 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0002/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0002/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0002.json) ## Question 25903: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0003`; number: 25903 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0003/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0003/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0003.json) ## Question 25904: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0004`; number: 25904 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0004/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0004/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0004.json) ## Question 25905: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0005`; number: 25905 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0005/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0005/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0005.json) ## Question 25906: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0006`; number: 25906 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0006/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0006/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0006.json) ## Question 25907: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0007`; number: 25907 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0007/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0007/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0007.json) ## Question 25908: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0008`; number: 25908 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0008/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0008/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0008.json) ## Question 25909: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0009`; number: 25909 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0009/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0009/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0009.json) ## Question 25910: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0010`; number: 25910 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0010/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0010/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0010.json) ## Question 25911: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0011`; number: 25911 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0011/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0011/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0011.json) ## Question 25912: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0012`; number: 25912 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0012/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0012/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0012.json) ## Question 25913: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0013`; number: 25913 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0013/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0013/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0013.json) ## Question 25914: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0014`; number: 25914 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0014/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0014/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0014.json) ## Question 25915: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0015`; number: 25915 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0015/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0015/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0015.json) ## Question 25916: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0016`; number: 25916 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0016/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0016/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0016.json) ## Question 25917: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0017`; number: 25917 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0017/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0017/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0017.json) ## Question 25918: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0018`; number: 25918 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0018/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0018/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0018.json) ## Question 25919: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0019`; number: 25919 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0019/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0019/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0019.json) ## Question 25920: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0020`; number: 25920 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0020/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0020/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0020.json) ## Question 25921: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0021`; number: 25921 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0021/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0021/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0021.json) ## Question 25922: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0022`; number: 25922 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0022/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0022/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0022.json) ## Question 25923: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0023`; number: 25923 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0023/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0023/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0023.json) ## Question 25924: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0024`; number: 25924 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0024/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0024/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0024.json) ## Question 25925: Every Source-Side Vertex Subset Defines One Directed Cut Audit - ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0025`; number: 25925 - Processing: second_context_reviewed - MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/) - Family: [qf-mod46-mfmc-complete-cut-enumeration](/en/explore/?family=qf-mod46-mfmc-complete-cut-enumeration) - Batch: [batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations) - [Derivation](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0025/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0025/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0025.json) [Next](/en/explore/index.md?mko=mko-max-flow-min-cut-theorem&page=2)