A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota (Q1814142)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota |
scientific article; zbMATH DE number 10172
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota |
scientific article; zbMATH DE number 10172 |
Statements
A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota (English)
0 references
25 June 1992
0 references
This is a very interesting paper on the following natural question: What is the largest subset of a poset having no comparable elements?
0 references
Ford-Fulkerson flows
0 references
Sperner property
0 references
largest subset of a poset
0 references
0.89975035
0 references
0.8711612
0 references
0 references
0 references
0.8473152
0 references
0 references
0.83877456
0 references
