Minimal vertex covers in infinite hypergraphs

Abstract

In this paper a hypergraph will be identified with the family of its edges. A hypergraph E possesses property C(k,) iff | E'|< for each E'∈ [ E]k. A vertex set Y⊂ E is a "vertex cover" of E iff E Y for each E∈ E. A vertex cover Y is "minimal" iff no proper subset of Y is vertex cover. If A is a set and S is a set of cardinals, write [A]S=\B⊂ A: |B|∈ S\. If λ and are cardinals, S is a set of cardinals, k∈ ω, then we write M(λ,S,k,μ) MinVC iff every hypergraph E⊂ [λ]S possessing property C(k,) has a minimal vertex cover. If S=\\, then we simply write M(λ,,k,μ) MinVC for M(λ,\\,k,μ) MinVC A set S of cardinals is "nowhere stationary" iff S α is not stationary in α for any ordinal α with cf(α)>ω. Countable sets of cardinals, and sets of successor cardinals are nowhere stationary. In this paper we prove: (1) M(λ,S,2,k) MinVC for each nowhere stationary set S of cardinals and ω λ, (2) M(λ, ,2,) MinVC provided <ω λ, (3) M(λ,ω,r,k) MinVC provided ω λ and k,r∈ ω, (4) M(λ,ω1,3,k) MinVC provided ω1 λ and k∈ ω.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…