{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T13:49:59Z","timestamp":1770040199463,"version":"3.49.0"},"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 oriented Ramsey number $\\vec{r}(H)$ for an acyclic digraph $H$ is the minimum integer $n$ such that any $n$-vertex tournament contains a copy of $H$ as a subgraph. We prove that the $1$-subdivision of the $k$-vertex transitive tournament $H_k$ satisfies $\\vec{r}(H_k)= O(k^2\\log\\log k)$. This is tight up to multiplicative $\\log\\log k$-term.\r\nWe also show that if $T$ is an $n$-vertex tournament with $\\Delta^+(T)-\\delta^+(T)= O(n\/k) - k^2$, then $T$ contains a $1$-subdivision of $\\vec{K}_k$, a complete $k$-vertex digraph with all possible $k(k-1)$ arcs. This is tight up to multiplicative constant.<\/jats:p>","DOI":"10.37236\/10788","type":"journal-article","created":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:50:53Z","timestamp":1649033453000},"source":"Crossref","is-referenced-by-count":1,"title":["On 1-Subdivisions of Transitive Tournaments"],"prefix":"10.37236","volume":"29","author":[{"given":"Jaehoon","family":"Kim","sequence":"first","affiliation":[]},{"given":"Hyunwoo","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Jaehyeon","family":"Seo","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2022,3,25]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i1p51\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i1p51\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:50:54Z","timestamp":1649033454000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v29i1p51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,25]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,1,27]]}},"URL":"https:\/\/doi.org\/10.37236\/10788","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,25]]},"article-number":"P1.51"}}