{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:57:21Z","timestamp":1771477041808,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We show that if the largest matching in a $k$-uniform hypergraph $G$ on $n$ vertices has precisely $s$ edges, and $n&gt;2k^2s\/\\log k$, then $H$ has at most $\\binom n k - \\binom {n-s} k $ edges and this upper bound is achieved only for hypergraphs in which the set of edges consists of all $k$-subsets which intersect a given set of $s$ vertices.<\/jats:p>","DOI":"10.37236\/2176","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:27:31Z","timestamp":1578713251000},"source":"Crossref","is-referenced-by-count":26,"title":["On Matchings in Hypergraphs"],"prefix":"10.37236","volume":"19","author":[{"given":"Peter","family":"Frankl","sequence":"first","affiliation":[]},{"given":"Tomasz","family":"\u0141uczak","sequence":"additional","affiliation":[]},{"given":"Katarzyna","family":"Mieczkowska","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2012,6,13]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v19i2p42\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v19i2p42\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T22:33:48Z","timestamp":1579300428000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v19i2p42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,13]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2012,4,7]]}},"URL":"https:\/\/doi.org\/10.37236\/2176","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,13]]},"article-number":"P42"}}