Positive Co-Degree Thresholds for Spanning Structures
The Electronic Journal of Combinatorics · 13.03.2026 · 33 (1)
DOI: 10.37236/13538 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 13.03.2026. Verfasst von Anastasia Halfpap und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
The minimum positive co-degree of a non-empty $r$-graph $H$, denoted $\delta_{r-1}^+(H)$, is the largest integer $k$ such that if a set $S \subset V(H)$ of size $r-1$ is contained in at least one $r$-edge of $H$, then $S$ is contained in at least $k$ $r$-edges of $H$. Motivated by several recent papers which study minimum positive co-degree as a reasonable notion of minimum degree in $r$-graphs, we consider bounds of $\delta_{r-1}^+(H)$ which will guarantee the existence of various spanning subgraphs in $H$. We precisely determine the minimum positive co-degree threshold for Berge Hamiltonian cycles in $r$-graphs, and asymptotically determine the minimum positive co-degree threshold for loose Hamiltonian cycles in $3$-graphs. For all $r$, we also determine up to an additive constant the minimum positive co-degree threshold for perfect matchings.
Zitieren
APA
Halfpap, A., & Magnan, V. (2026). Positive Co-Degree Thresholds for Spanning Structures. The Electronic Journal of Combinatorics, 33(1). https://doi.org/10.37236/13538
Vancouver
Halfpap A, Magnan V. Positive Co-Degree Thresholds for Spanning Structures. The Electronic Journal of Combinatorics. 2026;33(1). doi:10.37236/13538
BibTeX
@article{Halfpap2026,
author = {Halfpap, Anastasia and Magnan, Van},
title = {Positive Co-Degree Thresholds for Spanning Structures},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {1},
doi = {10.37236/13538}
}
EUVIMED