The travelling preacher, projection, and a lower bound for the stability number of a graph

Authors:
Kathie Cameron;Jack Edmonds
Affiliations:
Wilfrid Laurier University, Waterloo, Ontario, Canada N2L 3C5;EP Institute, Kitchener, Ontario, Canada N2M 2M6
Venue:
Discrete Optimization
Year:
2008

Citing 4
Cited 0

Coflow polyhedra

Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
Polyhedral and algorithmic ramifications of antichains

Polyhedral and algorithmic ramifications of antichains
Minmax relations for cyclically ordered digraphs

Journal of Combinatorial Theory Series B
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.