Counterexamples to Conjectures on Strong Maximality and Minimality
The Electronic Journal of Combinatorics · 14.04.2026 · 33 (2)
DOI: 10.37236/14948 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 14.04.2026. Verfasst von Lawrence Hollom und 1 weiteren Autor:innen.
Abstract (Originalsprache)
We provide counterexamples to several conjectures concerning strongly maximal and strongly minimal structures in infinite graphs and hypergraphs. In particular, we construct 3-uniform hypergraphs without strongly maximal matchings and without strongly minimal covers, and from our construction for covers we build a graph with no strongly minimal colouring. We also consider several refinements of these problems. Our results resolve conjectures and questions of Aharoni; Aharoni and Berger; Aharoni, Berger, Georgakopoulos, and Sprüssel; Aharoni and Korman; and Tardos.
Zitieren
APA
Hollom, L., & Shaw, B. R. (2026). Counterexamples to Conjectures on Strong Maximality and Minimality. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14948
Vancouver
Hollom L, Shaw BR. Counterexamples to Conjectures on Strong Maximality and Minimality. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14948
BibTeX
@article{Hollom2026,
author = {Hollom, Lawrence and Shaw, Benedict Randall},
title = {Counterexamples to Conjectures on Strong Maximality and Minimality},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {2},
doi = {10.37236/14948}
}
EUVIMED