Changes
[[himwiki:Discrete Time-Cost Tradeoff Problem]]
[[Compactness of Kőnig-property]]
A hypergraph <math>H=(V,E) </math> has the Kőnig-property if there is a set <math> \mathcal{D}\subseteq E </math> of pairwise disjoint hyperedges such that there is a vertex cover consists of one vertex from each hyperedge in <math> \mathcal{D} </math>. (Using this terminology Kőnig's theorem says that every finite bipartite graph has the Kőnig-property). R. Aharoni and N. Bowler formulated independently the following conjecture. If <math>H=(V,E) </math> is a hypergraph such that all of its hyperedges are finite and for all finite <math> E'\subseteq E </math> the hypergraph <math>(V,E') </math> has the Kőnig-property, then <math>H </math> has the Kőnig-property as well.
[[Lucchesi-Younger in infinite]]
