Papers
Topics
Authors
Recent
Search
2000 character limit reached

Concentration of the hypergraph's weak independence number

Published 16 Oct 2025 in math.CO and math.PR | (2510.15117v1)

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

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Stepan Vakhrushev 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up