Counterexample to a conjecture of Aharoni and Korman
Combinatorics
2022-05-06 v1
Abstract
Ron Aharoni and Vladimir Korman conjectured that any hypergraph with only finite edges has a strongly minimal cover. We present a counterexample.
Cite
@article{arxiv.2205.02296,
title = {Counterexample to a conjecture of Aharoni and Korman},
author = {Dominic van der Zypen},
journal= {arXiv preprint arXiv:2205.02296},
year = {2022}
}
Comments
2 pages