On the chromatic number in the stochastic block model
From MaRDI portal
Publication:6115511
DOI10.37236/10728zbMath1519.05076arXiv2109.00737OpenAlexW4382812043MaRDI QIDQ6115511
Publication date: 10 August 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.00737
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Szemerédi's lemma for the analyst
- On the independence number of random graphs
- On the chromatic number of random graphs
- A note on the chromatic number of a dense random graph
- Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
- A note on the sharp concentration of the chromatic number of random graphs
- Matching and covering the vertices of a random graph by copies of a given graph
- The concentration of the chromatic number of random graphs
- Connected components in random graphs with given expected degree sequences
- Independent sets, cliques, and colorings in graphons
- Introduction to Random Graphs
- Factors in random graphs
- Poisson approximation for large deviations
- Subgraphs with a large cochromatic number
- Community Detection and Stochastic Block Models
- The chromatic number of dense random graphs
- How Sharp is the Concentration of the Chromatic Number?
- Sharp concentration of the equitable chromatic number of dense random graphs
- Fractional chromatic number of a random subgraph
- Cliques in dense inhomogeneous random graphs
- On the existence of a factor of degree one of a connected random graph
- The chromatic number of random graphs
- The chromatic number of random graphs
- The two possible values of the chromatic number of a random graph
- On the chromatic number of random graphs
This page was built for publication: On the chromatic number in the stochastic block model
