scientific article; zbMATH DE number 5279368
From MaRDI portal
Publication:5387670
Recommendations
- A note on coloring sparse random graphs
- Local convergence of random graph colorings
- Local convergence of random graph colorings
- On the local colorings of graphs
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- Random I‐colorable graphs
- scientific article; zbMATH DE number 3895112
- Random sampling of colourings of sparse random graphs with a constant number of colours
Cited in
(15)- Constraining the clustering transition for colorings of sparse random graphs
- Local uniformity properties for Glauber dynamics on graph colorings
- Invariant colorings of random planar maps
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- Random instances of problems in NP -- algorithms and statistical physics
- Minimizing unsatisfaction in colourful neighbourhoods
- Randomly coloring graphs with lower bounds on girth and maximum degree
- Sampling random colorings of sparse random graphs
- Sampling in Potts model on sparse random graphs
- Spatial mixing of coloring random graphs
- Strong spatial mixing of list coloring of graphs
- A Simple Algorithm for Sampling Colorings of G(n,d/n) Up to The Gibbs Uniqueness Threshold
- Correlation decay and partition function zeros: algorithms and phase transitions
- Local convergence of random graph colorings
- Random sampling of colourings of sparse random graphs with a constant number of colours
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387670)
