Concentration of the hypergraph's weak independence number
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911344440115200 |
|---|---|
| author | Vakhrushev, Stepan |
| author_facet | Vakhrushev, Stepan |
| contents | 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}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_15117 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Concentration of the hypergraph's weak independence number Vakhrushev, Stepan Combinatorics Probability 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}$. |
| title | Concentration of the hypergraph's weak independence number |
| topic | Combinatorics Probability |
| url | https://arxiv.org/abs/2510.15117 |