On the Number of Solutions in Random Graphk-Colouring
From MaRDI portal
Publication:5219314
DOI10.1017/S0963548318000251zbMath1434.05135arXiv1609.04191OpenAlexW2963875595MaRDI QIDQ5219314
Publication date: 11 March 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.04191
Related Items (5)
A General Framework for Hypergraph Coloring ⋮ The number of satisfying assignments of random 2‐SAT formulas ⋮ Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs ⋮ Rigid Colorings of Hypergraphs and Contiguity ⋮ The replica symmetric phase of random constraint satisfaction problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A positive temperature phase transition in random hypergraph 2-coloring
- The phase transition in random regular exact cover
- Upper-bounding the \(k\)-colorability threshold by counting covers
- On the chromatic number of random regular graphs
- On the chromatic number of random \(d\)-regular graphs
- Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
- Expose-and-merge exploration and the chromatic number of a random graph
- A note on the sharp concentration of the chromatic number of random graphs
- The concentration of the chromatic number of random graphs
- Reconstruction and Clustering in Random Constraint Satisfaction Problems
- Almost all cubic graphs are Hamiltonian
- Almost all regular graphs are hamiltonian
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- Planting Colourings Silently
- Gibbs states and the set of solutions of random constraint satisfaction problems
- The freezing threshold for k-colourings of a random graph
- The chromatic number of random graphs
- The chromatic number of random graphs
- The condensation phase transition in random graph coloring
This page was built for publication: On the Number of Solutions in Random Graphk-Colouring
