Heritability of K\H{o}nig's Property from finite edge sets
Marc Kaufmann, Dominic van der Zypen

TL;DR
This paper investigates whether K"onig's Property in hypergraphs can be inherited from finite subsets of edges, providing a negative answer and exploring related weaker properties.
Contribution
It demonstrates that K"onig's Property is not inheritable from finite edge subsets and examines similar questions for weaker properties.
Findings
K"onig's Property is not inherited from finite subsets
Analysis of weaker properties related to K"onig's Property
Provides counterexamples to inheritance question
Abstract
A hypergraph is said to have K\H{o}nig's Property if there is a matching and such that for all , and is a vertex cover of . Aharoni posed the question whether K\H{o}nig's Property is inheritable from finite subsets of . We provide a negative answer and investigate similar questions for weaker properties.
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
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research
