On the concentration of the independence numbers of random hypergraphs
From MaRDI portal
Publication:2688835
DOI10.1515/dma-2023-0002OpenAlexW4321638975MaRDI QIDQ2688835
Ilya O. Denisov, Dmitriy A. Shabanov
Publication date: 6 March 2023
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma-2023-0002
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the independence number of random graphs
- Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
- Independence numbers of random sparse hypergraphs
- General independence sets in random strongly sparse hypergraphs
- On the weak chromatic number of random hypergraphs
- Random hypergraph coloring algorithms and the weak chromatic number
- On colouring random graphs
- Cliques in random graphs
- Two-Colorings of a Random Hypergraph
- Combinatorial approach to the interpolation method and scaling limits in sparse random graphs