# 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.

25 results; page 1/1.

## Question 25926: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0076`; number: 25926
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0076/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0076/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0076.json)

## Question 25927: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0077`; number: 25927
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0077/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0077/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0077.json)

## Question 25928: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0078`; number: 25928
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0078/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0078/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0078.json)

## Question 25929: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0079`; number: 25929
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0079/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0079/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0079.json)

## Question 25930: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0080`; number: 25930
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0080/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0080/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0080.json)

## Question 25931: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0081`; number: 25931
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0081/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0081/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0081.json)

## Question 25932: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0082`; number: 25932
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0082/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0082/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0082.json)

## Question 25933: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0083`; number: 25933
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0083/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0083/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0083.json)

## Question 25934: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0084`; number: 25934
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0084/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0084/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0084.json)

## Question 25935: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0085`; number: 25935
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0085/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0085/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0085.json)

## Question 25936: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0086`; number: 25936
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0086/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0086/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0086.json)

## Question 25937: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0087`; number: 25937
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0087/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0087/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0087.json)

## Question 25938: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0088`; number: 25938
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0088/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0088/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0088.json)

## Question 25939: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0089`; number: 25939
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0089/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0089/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0089.json)

## Question 25940: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0090`; number: 25940
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0090/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0090/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0090.json)

## Question 25941: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0091`; number: 25941
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0091/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0091/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0091.json)

## Question 25942: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0092`; number: 25942
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0092/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0092/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0092.json)

## Question 25943: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0093`; number: 25943
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0093/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0093/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0093.json)

## Question 25944: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0094`; number: 25944
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0094/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0094/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0094.json)

## Question 25945: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0095`; number: 25945
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0095/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0095/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0095.json)

## Question 25946: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0096`; number: 25946
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0096/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0096/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0096.json)

## Question 25947: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0097`; number: 25947
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0097/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0097/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0097.json)

## Question 25948: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0098`; number: 25948
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0098/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0098/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0098.json)

## Question 25949: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0099`; number: 25949
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0099/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0099/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0099.json)

## Question 25950: An Equal-Valued Feasible Flow and Cut Certify Both Optima

- ID: `q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0100`; number: 25950
- Processing: second_context_reviewed
- MKO: [mko-max-flow-min-cut-theorem](/en/mko/mko-max-flow-min-cut-theorem/)
- Family: [qf-mod46-mfmc-equal-value-optimality](/en/explore/?family=qf-mod46-mfmc-equal-value-optimality)
- 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-0100/) / [Markdown](/en/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0100/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0100.json)