Abstract
We discuss three equivalent formulations of a theorem of Seymour on nonnegative sums of circuits of a graph, and present a different (but not shorter) proof of Seymour's resut.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. J. Hoffman, Some recent applications of the theory of linear inequalities to extremal combinatorial analysis,Proc. Sympos. Appl. Math. 10 (1960). See also L. R. Ford, Jr. and D. R. Fulkerson,Flows in Networks, 51, Princeton University Press, Princeton, 1974.
P. D. Seymour, Sums of circuits, inGraph Theory and Related Topics, 341–355 (J. A. Bondy and U. S. R. Murty, eds.), Academic Press, New York, 1979.
Author information
Authors and Affiliations
Additional information
Research supported, in part, by an IBM Postdoctoral Fellowship, a grant of the Alexander von Humboldt-Stiftung, and NSF grant DMS-8504050.
Rights and permissions
About this article
Cite this article
Hoffman, A.J., Lee, C.W. On the cone of nonnegative circuits. Discrete Comput Geom 1, 229–239 (1986). https://doi.org/10.1007/BF02187697
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187697