{"paper":{"title":"On a Tur\\'an problem in weakly quasirandom 3-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Reiher, Mathias Schacht, Vojt\\v{e}ch R\\\"odl","submitted_at":"2016-02-06T18:51:32Z","abstract_excerpt":"Extremal problems for $3$-uniform hypergraphs are known to be very difficult and despite considerable effort the progress has been slow. We suggest a more systematic study of extremal problems in the context of quasirandom hypergraphs. We say that a $3$-uniform hypergraph $H=(V,E)$ is weakly $(d,\\eta)$-quasirandom if for any subset $U\\subseteq V$ the number of hyperedges of $H$ contained in $U$ is in the interval $d\\binom{|U|}{3}\\pm\\eta|V|^3$. We show that for any $\\varepsilon>0$ there exists $\\eta>0$ such that every sufficiently large weakly $(1/4+\\varepsilon,\\eta)$-quasirandom hypergraph con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02290","kind":"arxiv","version":3},"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"}