D2.3.3 Use of the max–flow min–cut theorem to prove that a flow is a…

Section
D2.3 Flows in networks
Level
AS & A level
Statement
Use of the max–flow min–cut theorem to prove that a flow is a maximum flow.
Since 2018
18 parts, 48 marks · topic pages: Flows in networks

Back to the checklist

June 2025 · AS Paper 2 (Decision 2) · Q2(f) 3 marks
(f) Prove that the answer to part (e) is a maximum flow. (3)
June 2025 · Paper 4D (Decision 2) · Q4(b) 1 mark
(b) Using only the capacities of cuts C1 and C2 , state what can be deduced about the maximum flow through the system. (1)
June 2025 · Paper 4D (Decision 2) · Q4(f) 3 marks
(f) Prove that the answer to part (e) is optimal. (3)
June 2024 · AS Paper 2 (Decision 2) · Q1(e) 3 marks
The flow augmenting route in part (d) is applied to give an increased flow. (e) Prove that this increased flow is maximal. (3)
June 2024 · Paper 4D (Decision 2) · Q1(e) 3 marks
The flow‑augmenting route from (d) is used to increase the flow from S to T. (e) Prove that the flow is now maximal. (3)
June 2023 · AS Paper 2 (Decision 2) · Q2(e) 3 marks
(e) Prove that the answer to (d) is optimal. (3)
June 2023 · Paper 4D (Decision 2) · Q1(d) 3 marks
(d) Prove that, once the flow-augmenting route found in (c) has been applied, the flow is now maximal. (3)
June 2022 · AS Paper 2 (Decision 2) · Q2(f) 3 marks
Given that the flow through the network is increased by three units, (f) prove that this new flow is maximal. (3)
June 2022 · Paper 4D (Decision 2) · Q4(f) 3 marks
(f) Prove that, once the flow‑augmenting route found in part (e) has been applied, the flow is maximal. (3)
Nov 2021 · Paper 4D (Decision 2) · Q5(b) 1 mark
(b) Using only the capacities of cuts C1 and C2 , state what can be deduced about the maximum flow through the system. (1)
Nov 2021 · Paper 4D (Decision 2) · Q5(g) 3 marks
(g) Prove that the answer to (f) is optimal. (3)
Oct 2020 · AS Paper 2 (Decision 2) · Q1(e) 3 marks
Given that the flow through the network is increased by two units using the route found in (d), (e) prove that this new flow is maximal. (3)
Oct 2020 · Paper 4D (Decision 2) · Q5(f) 3 marks
(f) Prove that the answer to (e) is the maximum flow through the system. (3)
June 2019 · AS Paper 2 (Decision 2) · Q3(f) 3 marks
(f) Prove that the answer to part (e) is optimal. (3)
June 2019 · Paper 4D (Decision 2) · Q6(d) 4 marks
(d) Hence determine a minimum feasible flow and a maximum feasible flow through the system. You must draw these feasible flows on the diagrams in the answer book and give reasons to justify your answer. You should not apply the labelling procedure to find these flows. (4)
June 2018 · AS Paper 2 (Decision 2) · Q3(b) 1 mark
(b) Using only the capacities of cuts C1 and C2 state what can be deduced about the maximum possible flow through the system. (1)
June 2018 · AS Paper 2 (Decision 2) · Q3(d) 2 marks
(d) Prove that 120 litres per minute is the maximum possible flow through the system. (2)
June 2018 · AS Paper 2 (Decision 2) · Q3(e) 3 marks
A new pipe is planned from S to A. Let the capacity of this pipe be x litres per minute. (e) Find, in terms of x where necessary, the maximum possible flow through the new system. (3)

Find an Edexcel Further Maths tutor

Stuck on this? Book a trial lesson with our Further Maths tutor.

Prefer email? Send an enquiry

If you are under 18, please include a parent's contact details. Enquiries go to enquiries@alevelfurthermathstutor.com and are deleted once handled.