On the number of solutions in random hypergraph 2-colouring

zbMath1369.05086arXiv1603.07523MaRDI QIDQ2401392

Felicia Rassmann

Publication date: 8 September 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.07523

zbMATH Keywords

partition functionlimiting distributionrandom hypergraphssmall subgraph conditioning2-colouring

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

The Number of Satisfying Assignments of Random Regulark-SAT Formulas ⋮ A General Framework for Hypergraph Coloring ⋮ Charting the replica symmetric phase

Cites Work

• Unnamed Item
• A positive temperature phase transition in random hypergraph 2-coloring
• The phase transition in random regular exact cover
• Reconstruction and Clustering in Random Constraint Satisfaction Problems
• The Number of Satisfying Assignments of Random Regulark-SAT Formulas
• Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
• Almost all regular graphs are hamiltonian
• Two‐coloring random hypergraphs
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Planting Colourings Silently
• Gibbs states and the set of solutions of random constraint satisfaction problems
• Catching the k-NAESAT threshold
• The freezing threshold for k-colourings of a random graph
• Frozen variables in random boolean constraint satisfaction problems
• The condensation transition in random hypergraph 2-coloring
• The condensation phase transition in random graph coloring

This page was built for publication: On the number of solutions in random hypergraph 2-colouring