Minimal vertex covers in infinite hypergraphs
Tam\'as Csern\'ak, Lajos Soukup

TL;DR
This paper investigates conditions under which infinite hypergraphs with certain intersection properties have minimal vertex covers, providing several new theorems for different set and cardinal configurations.
Contribution
It introduces new results on minimal vertex covers in infinite hypergraphs with property C(k,ρ), extending understanding in set-theoretic hypergraph theory.
Findings
Proves minimal vertex cover existence for hypergraphs with nowhere stationary sets.
Establishes bounds for cardinals where minimal vertex covers exist.
Provides conditions for hypergraphs with specific intersection properties.
Abstract
In this paper a hypergraph will be identified with the family of its edges. A hypergraph possesses property iff for each . A vertex set is a "vertex cover" of iff for each . A vertex cover is "minimal" iff no proper subset of is vertex cover. If is a set and is a set of cardinals, write If and are cardinals, is a set of cardinals, , then we write iff every hypergraph possessing property has a minimal vertex cover. If , then we simply write $\mathbf M({{\lambda}},{\kappa},{k},{{\mu}})\to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Advanced Topology and Set Theory · Digital Image Processing Techniques
