arXiv (OAI Expanded)
open access
Concentration of the hypergraph's weak independence number
In this note we generalize the results of the recent work by Tom Bohman and Jacob Hofstad on the independence number in G(n, p) to the case of the random k-uniform hypergraph. Concentration in two values occurs in the regime $p>n^{-(k-1)k/(k+1)+\varepsilon}$.
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
- Concentration of the hypergraph's weak independence number#924465
- Estimates of the coverage of parameter space by Latin hypercube and orthogonal array-based sampling#955423
- Asymptotics of the Brown--Erdős--Sós problem at integer exponents#1142411
- Enumeration of regular multipartite hypergraphs#1049618
- On the distinct maximal-clique sizes in $k$-uniform hypergraphs#998314
Record · ID 920234
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