{"paper":{"title":"On the Ramsey classes of random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dingyuan Liu","submitted_at":"2026-05-27T13:37:27Z","abstract_excerpt":"Let $r,s,t\\geq2$ be integers. For $r$-graphs $G$ and $F_1,\\dots,F_s$, we write $G\\to(F_1,\\dots,F_s)$ if every $s$-edge-coloring of $G$ yields a monochromatic copy of $F_i$ in the $i$-th color for some $1\\leq i\\leq s$. Let $\\mathcal{R}(F_1,\\dots,F_s)$ denote the family of all $r$-graphs $G$ with $G\\to(F_1,\\dots,F_s)$. When $F_1=\\dots=F_s=F$, we write $\\mathcal{R}(F;s)=\\mathcal{R}(F_1,\\dots,F_s)$.\n  In this paper, we investigate when $\\mathcal{R}(H;s)\\subseteq\\mathcal{R}(Q_1,\\dots,Q_t)$ holds, where $H=H^{(r)}(n,p)$ is a random $r$-graph and $Q_1,\\dots,Q_t$ are fixed $r$-graphs. Our main result "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28472","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.28472/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"}