arXiv (All)
open access
Rainbow Berge Hamiltonicity in edge-colored random $k$-uniform hypergraphs
Let $H \sim H^{k}_c(n,p)$ be an edge-colored random $k$-uniform hypergraph on the vertex set $[n]$, where each edge $e \in \binom{[n]}{k}$ is included independently with probability $p$ and is uniformly and independently assigned a color from the color set $[c]$. For $k = 2$, Ferber and Krivelevich
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Infinitely many size-Ramsey numbers of $k$-uniform relaxed $\ell$-trees are not polynomial#971390
- Infinitely many size-Ramsey numbers of $k$-uniform relaxed $\ell$-trees are not polynomial#965978
- Coefficients of the Characteristic Polynomial of a Hypergraph and Their Combinatorial Properties#201153
- C~21~H~35~BF~4~N~2~#941310
- C~22~H~34~N~8~Ru, C~2~H~3~N, 4(F~6~P), H~2~O#941350
Record · ID 822398
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive