{"paper":{"title":"A hypergraph bipartite Tur\\'an problem with odd uniformity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Tianchi Yang","submitted_at":"2024-03-07T08:35:36Z","abstract_excerpt":"In this paper, we investigate the hypergraph Tur\\'an number $ex(n,K^{(r)}_{s,t})$. Here, $K^{(r)}_{s,t}$ denotes the $r$-uniform hypergraph with vertex set $\\left(\\cup_{i\\in [t]}X_i\\right)\\cup Y$ and edge set $\\{X_i\\cup \\{y\\}: i\\in [t], y\\in Y\\}$, where $X_1,X_2,\\cdots,X_t$ are $t$ pairwise disjoint sets of size $r-1$ and $Y$ is a set of size $s$ disjoint from each $X_i$. This study was initially explored by Erd\\H{o}s and has since received substantial attention in research. Recent advancements by Brada\\v{c}, Gishboliner, Janzer and Sudakov have greatly contributed to a better understanding of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.04318","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.04318/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"}