{"paper":{"title":"Even cycles in dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Czygrinow, Jangwon Yie, Neal Bushaw","submitted_at":"2018-06-25T18:22:24Z","abstract_excerpt":"We will show that for $\\alpha>0$ there is $n_0$ such that if $G$ is a graph on $n\\geq n_0$ vertices such that $\\alpha n< \\delta(G)< (n-1)/2$, then for every $n_1+n_2+\\cdots +n_l= \\delta(G)$, $G$ contains a disjoint union of $C_{2n_1},C_{2n_2}, \\dots, C_{2n_l}$ unless $G$ has a very specific structure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09651","kind":"arxiv","version":2},"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"}