The global theory of flows in networks

DOI10.1016/0196-8858(80)90009-3zbMath0469.90028OpenAlexW1983901655MaRDI QIDQ1157274

Lawrence H. Harper

Publication date: 1980

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-8858(80)90009-3

zbMATH Keywords

computational complexitymaximum flowSperner's theoremflow morphisms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Epimorphisms, monomorphisms, special classes of morphisms, null morphisms (18A20) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Graphs, diagram schemes, precategories (18A10)

Related Items (13)

Integer partitions and the Sperner property ⋮ Optimal representations of partially ordered sets and a limit Sperner theorem ⋮ Morphisms for resistive electrical networks ⋮ Linear programming the global approach ⋮ The global theory of paths in networks. I: Definitions, examples and limits ⋮ A solution of the Sperner-Erdős problem ⋮ \(q\)-weighted log-concavity and \(q\)-product theorem on the normality of posets ⋮ A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota ⋮ A natural notion of morphism for linear programming problems ⋮ The symmetric group, ordered by refinement of cycles, is strongly Sperner ⋮ The absolute orders on the Coxeter groups \(A_n\) and \(B_n\) are Sperner ⋮ A new proof of a theorem of Harper on the Sperner-Erdős problem ⋮ Morphisms for the strong Sperner property of Stanley and Griggs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum antichains of rectangular arrays
• Application of the Berry-Esseen inequality to combinatorial estimates
• A Sperner theorem for the interval order of a projective geometry
• The morphology of partially ordered sets
• On a problem of Rota
• Central and local limit theorems for the coefficients of polynomials of binomial type
• A counterexample to the generalisation of Sperner's theorem
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• On the Location of the Maximum Stirling Number(s) of the Second Kind
• Some Results on Matching in Bipartite Graphs

This page was built for publication: The global theory of flows in networks