{"paper":{"title":"Tur\\'an numbers for Berge-hypergraphs and related extremal problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Zsolt Wagner, Cory Palmer, Craig Timmons, Michael Tait","submitted_at":"2017-06-13T20:44:08Z","abstract_excerpt":"Let $F$ be a graph. We say that a hypergraph $H$ is a {\\it Berge}-$F$ if there is a bijection $f : E(F) \\rightarrow E(H )$ such that $e \\subseteq f(e)$ for every $e \\in E(F)$. Note that Berge-$F$ actually denotes a class of hypergraphs. The maximum number of edges in an $n$-vertex $r$-graph with no subhypergraph isomorphic to any Berge-$F$ is denoted $\\ex_r(n,\\textrm{Berge-}F)$. In this paper we establish new upper and lower bounds on $\\ex_r(n,\\textrm{Berge-}F)$ for general graphs $F$, and investigate connections between $\\ex_r(n,\\textrm{Berge-}F)$ and other recently studied extremal functions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04249","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"}