{"paper":{"title":"Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Yeo, Hugues Depres, J{\\o}rgen Bang-Jensen","submitted_at":"2019-07-01T15:20:03Z","abstract_excerpt":"A digraph is {\\bf eulerian} if it is connected and every vertex has its in-degree equal to its out-degree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltonian cycle. A digraph is {\\bf semicomplete} if it has no pair of non-adjacent vertices. A {\\bf tournament} is a semicomplete digraph without directed cycles of length 2. Fraise and Thomassen \\cite{fraisseGC3} proved that every $(k+1)$-strong tournament has a hamiltonian cycle which avoids any prescribed set of $k$ arcs. In \\cite{bangsupereuler} the authors demonstrated that a number of results concerning vertex-c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00853","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}