{"paper":{"title":"Tur\\'an's Problem for Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lin-Lin Wang, Zhi-Hong Sun","submitted_at":"2014-10-27T12:56:19Z","abstract_excerpt":"For a forbidden graph $L$, let $ex(p;L)$ denote the maximal number of edges in a simple graph of order $p$ not containing $L$. Let $T_n$ denote the unique tree on $n$ vertices with maximal degree $n-2$, and let $T_n^*=(V,E)$ be the tree on $n$ vertices with $V=\\{v_0,v_1,\\ldots,v_{n-1}\\}$ and\n  $E=\\{v_0v_1,\\ldots,v_0v_{n-3},v_{n-3}v_{n-2},v_{n-2}v_{n-1}\\}$. In the paper we give exact values of $ex(p;T_n)$ and $ex(p;T_n^*)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7213","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"}