{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T23:34:24Z","timestamp":1773444864038,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.37236\/13538","type":"journal-article","created":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T22:22:10Z","timestamp":1773440530000},"source":"Crossref","is-referenced-by-count":0,"title":["Positive Co-Degree Thresholds for Spanning Structures"],"prefix":"10.37236","volume":"33","author":[{"given":"Anastasia","family":"Halfpap","sequence":"first","affiliation":[]},{"given":"Van","family":"Magnan","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2026,3,13]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i1p48\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i1p48\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T22:22:17Z","timestamp":1773440537000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v33i1p48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,13]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1,9]]}},"URL":"https:\/\/doi.org\/10.37236\/13538","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,13]]},"article-number":"P1.48"}}