{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:01Z","timestamp":1753893841703,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>While the edges of every tournament can be covered with two spanning acyclic subgraphs, this is not so if we set out to cover all acyclic $H$-subgraphs of a tournament with spanning acyclic subgraphs, even for very simple $H$ such as the $2$-edge directed path or the $2$-edge out-star. We prove new bounds for the minimum number of elements in such coverings and for some $H$ our bounds determine the exact order of magnitude.\r\nA $k$-tournament is an orientation of the complete $k$-graph, where each $k$-set is given a total order (so tournaments are $2$-tournaments). As opposed to tournaments, already covering the edges of a $3$-tournament with the minimum number of spanning acyclic subhypergraphs is a nontrivial problem. We prove a new lower bound for this problem which asymptotically matches the known lower bound of covering all ordered triples of a set.<\/jats:p>","DOI":"10.37236\/9336","type":"journal-article","created":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T04:05:33Z","timestamp":1603253133000},"source":"Crossref","is-referenced-by-count":0,"title":["Covering Small Subgraphs of (Hyper)Tournaments with Spanning Acyclic Subgraphs"],"prefix":"10.37236","volume":"27","author":[{"given":"Raphael","family":"Yuster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2020,10,16]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i4p13\/8194","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i4p13\/8194","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T04:05:34Z","timestamp":1603253134000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i4p13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,16]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,10,2]]}},"URL":"https:\/\/doi.org\/10.37236\/9336","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2020,10,16]]},"article-number":"P4.13"}}