{"paper":{"title":"Subgraphs with large minimum $\\ell$-degree in hypergraphs where almost all $\\ell$-degrees are large","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Victor Falgas-Ravry","submitted_at":"2016-10-20T12:28:03Z","abstract_excerpt":"Let $G$ be an $r$-uniform hypergraph on $n$ vertices such that all but at most $\\varepsilon \\binom{n}{\\ell}$ $\\ell$-subsets of vertices have degree at least $p \\binom{n-\\ell}{r-\\ell}$.\n  We show that $G$ contains a large subgraph with high minimum $\\ell$-degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06378","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":""},"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"}