Fractional matchings and covers in infinite hypergraphs (Q1115456)
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: Fractional matchings and covers in infinite hypergraphs |
scientific article; zbMATH DE number 4085700
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fractional matchings and covers in infinite hypergraphs |
scientific article; zbMATH DE number 4085700 |
Statements
Fractional matchings and covers in infinite hypergraphs (English)
0 references
1985
0 references
A strong version of the duality theorem of linear programming is proved for fractional covers and matchings in countable graphs. It is conjectured to hold for general hypergraphs. In Section 2 we show that in countable hypergraphs there does not necessarily exist a maximal matchable set, contrary to the situation in graphs.
0 references
fractional covers
0 references
matchings
0 references
countable graphs
0 references
hypergraphs
0 references
countable hypergraphs
0 references
0.9682772
0 references
0 references
0.93194276
0 references
0.9279115
0 references
0.9279115
0 references
0 references
0.91811717
0 references
