[Submitted on 16 Oct 2025 (v1), last revised 2 Sep 2026 (this version, v3)]

View PDF HTML (experimental)

Abstract: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}$.

Submission history

From: Stepan Vakhrushev [view email]
[v1] Thu, 16 Oct 2025 20:19:51 UTC (29 KB)
[v2] Mon, 29 Dec 2025 20:24:56 UTC (25 KB)
[v3] Wed, 2 Sep 2026 17:36:43 UTC (25 KB)

Current browse context:

math.CO

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.