{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T05:25:43Z","timestamp":1784006743312,"version":"3.55.0"},"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>For three integers $n,k,d$, we determine the maximum size of a graph on $n$ vertices with fractional matching number $k$ and maximum degree at most $d$. As a consequence, we obtain the maximum size of a graph with given number of vertices and fractional matching number. This partially confirms a conjecture proposed by Alon et al. on the maximum size of $r$-uniform hypergraph with a fractional matching number for the special case when $r=2$.<\/jats:p>","DOI":"10.37236\/11022","type":"journal-article","created":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T07:46:20Z","timestamp":1662623180000},"source":"Crossref","is-referenced-by-count":3,"title":["Maximum Size of a Graph with Given Fractional Matching Number"],"prefix":"10.37236","volume":"29","author":[{"given":"Tianlong","family":"Ma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianguo","family":"Qian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2022,9,9]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i3p55\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i3p55\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T07:46:20Z","timestamp":1662623180000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v29i3p55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,9]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,7,1]]}},"URL":"https:\/\/doi.org\/10.37236\/11022","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,9]]},"article-number":"P3.55"}}