Fractional matchings and covers in infinite hypergraphs (Q1115456): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: 2-Matchings and 2-covers of hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Injective choice functions for countable families / rank | |||
Normal rank | |||
Latest revision as of 12:57, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fractional matchings and covers in infinite hypergraphs |
scientific article |
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
