Nonintersecting Ryser Hypergraphs
2020
A famous conjecture of Ryser states that every $r$-partite hypergraph has vertex cover number at most $r - 1$ times the matching number. In recent years, hypergraphs meeting this conjectured bound,...
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
3
Citations
NaN
KQI