{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:19Z","timestamp":1753893859283,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in a 3-uniform hypergraph without an isolated vertex. Suppose that $H$ is a 3-uniform hypergraph whose order $n$ is sufficiently large and divisible by $3$. If $H$ contains no isolated vertex and $\\deg(u)+\\deg(v) &gt; \\frac{2}{3}n^2-\\frac{8}{3}n+2$ for any two vertices $u$ and $v$ that are contained in some edge of $H$, then $H$ contains a perfect matching. This bound is tight and the (unique) extremal hyergraph is a different space barrier from the one for the corresponding Dirac problem.<\/jats:p>","DOI":"10.37236\/7658","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:10:19Z","timestamp":1578669019000},"source":"Crossref","is-referenced-by-count":2,"title":["Vertex Degree Sums for Perfect Matchings in 3-Uniform Hypergraphs"],"prefix":"10.37236","volume":"25","author":[{"given":"Yi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yi","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Mei","family":"Lu","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2018,9,7]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i3p45\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i3p45\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:26:24Z","timestamp":1579235184000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i3p45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,7]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,7,12]]}},"URL":"https:\/\/doi.org\/10.37236\/7658","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,9,7]]},"article-number":"P3.45"}}