A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota

DOI10.1016/0196-8858(91)90006-5MaRDI QIDQ1814142zbMATH OpenOpenAlexFDO

Authors Lawrence H. Harper

Publication date 25 June 1992

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

Full work available at URL https://doi.org/10.1016/0196-8858(91)90006-5

zbMATH Keywords

Ford-Fulkerson flowslargest subset of a posetSperner property

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Review text

This is a very interesting paper on the following natural question: What is the largest subset of a poset having no comparable elements?

Recommendations

• Duality theorems for a continuous analog of Ford-Fulkerson flows in networks
• On solving continuous-time dynamic network flows
• On continuous network flows
• Continuous-Time Flows in Networks
• An Approximation for a Continuous Max-Flow Problem
• Semi-continuous network flow problems
• scientific article; zbMATH DE number 1377930
• Explicit formulae for limit periodic flows on networks
• scientific article; zbMATH DE number 3982887

Cites work

• A simple counterexample to a conjecture of Rota
• scientific article; zbMATH DE number 3848938 (Why is no real title available?)
• scientific article; zbMATH DE number 3827547 (Why is no real title available?)
• On a continuous analog of Sperner's problem
• On a problem of Rota
• Superantichains in the Lattice of Partitions of a Set
• The global theory of flows in networks
• The morphology of partially ordered sets

Cited in

(1)

• Large antichains in the partition lattice

This page was built for publication: A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814142)