Compactness of Kőnig-property
Statement
A hypergraph has the Kőnig-property if there is a set of pairwise disjoint hyperedges such that there is a vertex cover consisting of one vertex from each hyperedge in . (Using this terminology, Kőnig's theorem says that every finite bipartite graph has the Kőnig-property). R. Aharoni and N. Bowler conjectured independently the following. If is a hypergraph such that all of its hyperedges are finite and for all finite the hypergraph has the Kőnig-property, then has the Kőnig-property as well ( p. 19. Problem 6.7).
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.