flâneur

[2505.05339] A Counterexample to a Conjecture of Lovász

arxiv.org · 175 words · saved by 1 readers

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. arXiv Operational Status Get status notifications via email or slack

View PDF Abstract:In 1975 Lovász conjectured that every $r$-partite, $r$-uniform hypergraph contains $r-1$ vertices whose deletion reduces the matching number. If true, this statement would imply a well-known conjecture of Ryser from 1971, which states that every $r$-partite, $r$-uniform hypergraph has a vertex cover of size at most $r-1$ times its matching number. When $r=2$, Ryser's conjecture is simply Kőnig's theorem, and the conjecture of Lovász is an immediate corollary. Ryser's conjecture for $r=3$ was proven by Aharoni in 2001, and remains open for all $r\geq 4$. Here we show that…

saved by

related reading