{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:50Z","timestamp":1753893830162,"version":"3.41.2"},"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>Given a graph $G$, denote by $h(G)$ the smallest size of a subset of $V(G)$ which intersects every maximum independent set of $G$. We prove that any graph $G$ without induced matching of size $t$ satisfies $h(G)\\le \\omega(G)^{3t-3+o(1)}$. This resolves a conjecture of Hajebi, Li and Spirkl [Hitting all maximum stable sets in $P_{5}$-free graphs. J. Combin. Theory Ser. B, 165:142-163, 2024].<\/jats:p>","DOI":"10.37236\/13469","type":"journal-article","created":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T16:25:39Z","timestamp":1738254339000},"source":"Crossref","is-referenced-by-count":1,"title":["Piercing Independent Sets in Graphs without Large Induced Matching"],"prefix":"10.37236","volume":"32","author":[{"given":"Jiangdong","family":"Ai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zixiang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2025,1,31]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i1p10\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i1p10\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T16:25:40Z","timestamp":1738254340000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v32i1p10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,31]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,1,17]]}},"URL":"https:\/\/doi.org\/10.37236\/13469","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2025,1,31]]},"article-number":"P1.10"}}