| Article ID: | iaor20091414 |
| Country: | Netherlands |
| Volume: | 5 |
| Issue: | 2 |
| Start Page Number: | 290 |
| End Page Number: | 292 |
| Publication Date: | May 2008 |
| Journal: | Discrete Optimization |
| Authors: | Cameron Kathie, Edmonds Jack |
| Keywords: | networks |
The coflow min–max equality is given a travelling preacher interpretation, and is applied to give a lower bound on the maximum size of a set of vertices, no two of which are joined by an edge.