{"paper":{"title":"Chromatic Number of Random Kneser Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hossein Hajiabolhassan, Meysam Alishahi","submitted_at":"2016-07-25T19:57:01Z","abstract_excerpt":"Recently, Kupavskii~[{\\it On random subgraphs of {K}neser and {S}chrijver graphs. J. Combin. Theory Ser. A, {\\rm 2016}.}] investigated the chromatic number of random Kneser graphs $\\KG_{n,k}(\\rho)$ and proved that, in many cases, the chromatic numbers of the random Kneser graph $\\KG_{n,k}(\\rho)$ and the Kneser graph $\\KG_{n,k}$ are almost surely closed. He also marked the studying of the chromatic number of random Kneser hypergraphs $\\KG^r_{n,k}(\\rho)$ as a very interesting problem. With the help of $\\Z_p$-Tucker lemma, a combinatorial generalization of the Borsuk-Ulam theorem, we generalize K"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07432","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"}