{"paper":{"title":"Turan numbers of complete 3-uniform Berge-hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"L. Maherani, M. Shahsiah","submitted_at":"2016-12-28T11:32:32Z","abstract_excerpt":"Given a family $\\mathcal{F}$ of $r$-graphs, the Tur\\'{a}n number of $\\mathcal{F}$ for a given positive integer $N$, denoted by $ex(N,\\mathcal{F})$, is the maximum number of edges of an $r$-graph on $N$ vertices that does not contain any member of $\\mathcal{F}$ as a subgraph.  For given $r\\geq 3$, a  complete $r$-uniform Berge-hypergraph, denoted by { ${K}_n^{(r)}$}, is an $r$-uniform hypergraph of order $n$  with the core sequence $v_{1}, v_{2}, \\ldots ,v_{n}$ as the vertices and  distinct edges $e_{ij},$ $1\\leq i<j\\leq n,$ where every $e_{ij}$ contains both   $v_{i}$ and $v_{j}$. Let $\\mathca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08856","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"}