Approximate max-flow min-cut theorem
This page lists the items of the Wikipedia article Approximate max-flow min-cut theorem in their order, and the nodes of Math 2.0 that have them. The text of the article is not on this site. The items come from revision 1368905290, with the assessment C/Low.
| Outcome | Items |
|---|---|
| deferred | 7 |
The gap signals of the article are S3,S5,S6,S9.
| Item | Kind | Name | Outcome | Nodes | Reason |
|---|---|---|---|---|---|
| subject | statement | Approximate max-flow min-cut theorem | deferred until 2027-05-01 | the item has the flag informal (WP9.2) | |
| #5CE8 | statement | Theorem 5 | deferred until 2027-05-01 | the item has no name of its own, and the write role names it | |
| #BCU6 | statement | Theorem 4 | deferred until 2027-05-01 | the item has no name of its own, and the write role names it | |
| #SDKQ | statement | Theorem 1 | deferred until 2027-05-01 | the item has no name of its own, and the write role names it | |
| #VCKN | problem | Theorems of uniform multicommodity flow problems | deferred until 2027-05-01 | the heading names a part of the text and not one item | |
| #WOCZ | statement | Theorem 3 | deferred until 2027-05-01 | the item has no name of its own, and the write role names it | |
| #ZPGQ | statement | Theorem 2 | deferred until 2027-05-01 | the item has no name of its own, and the write role names it |
Refer to Wikipedia articles and their nodes for the other articles.