{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:27Z","timestamp":1753893867756,"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>The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph $G$ with ${n+1\\choose 2}$ edges admits an edge decomposition $G=H_1\\oplus\\cdots \\oplus H_n$ such that $H_i$ has $i$ edges and it is isomorphic to a subgraph of $H_{i+1}$, $i=1,\\ldots ,n-1$. We show that every bipartite graph $G$ with ${n+1\\choose 2}$ edges such that the degree sequence $d_1,\\ldots ,d_k$ of one of the stable sets satisfies $ d_{k-i}\\ge n-i\\; \\text{for each}\\; 0\\le i\\le k-1$, admits an ascending subgraph decomposition with star forests. We also give a necessary condition on the degree sequence which is not far from the above sufficient one.<\/jats:p>","DOI":"10.37236\/5380","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T19:31:50Z","timestamp":1578684710000},"source":"Crossref","is-referenced-by-count":0,"title":["On Star Forest Ascending Subgraph Decomposition"],"prefix":"10.37236","volume":"24","author":[{"given":"Josep M.","family":"Aroca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Llad\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2017,2,3]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p14\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p14\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T05:06:01Z","timestamp":1579237561000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i1p14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,3]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,1,20]]}},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.37236\/5380","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2017,2,3]]},"article-number":"P1.14"}}