Rigid Colorings of Hypergraphs and Contiguity

DOI10.1137/18M1207211zbMath1420.05159arXiv1808.04060WikidataQ127300456 ScholiaQ127300456MaRDI QIDQ5233753

Peter Ayre, Catherine Greenhill

Publication date: 6 September 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphscontiguitycolorings

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

On the maximal cut in a random hypergraph ⋮ Estimating the \(r\)-colorability threshold for a random hypergraph ⋮ On the structure of the set of panchromatic colorings of a random hypergraph ⋮ On the connectivity of proper colorings of random graphs and hypergraphs ⋮ On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs ⋮ The replica symmetric phase of random constraint satisfaction problems

Cites Work

• Unnamed Item
• Unnamed Item
• A positive temperature phase transition in random hypergraph 2-coloring
• On the Lambert \(w\) function
• On the chromatic number of a random hypergraph
• On the freezing of variables in random constraint satisfaction problems
• Lower bounds on the chromatic number of random graphs
• Coloring Random Graphs
• Quiet Planting in the Locked Constraint Satisfaction Problems
• The large deviations of the whitening process in random constraint satisfaction problems
• Almost all cubic graphs are Hamiltonian
• The Freezing Threshold for k -Colourings of a Random Graph
• Phase transitions in theq-coloring of random hypergraphs
• The stripping process can be slow: Part I
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• On the Number of Solutions in Random Graphk-Colouring
• Survey propagation: An algorithm for satisfiability
• Planting Colourings Silently
• The freezing threshold for k-colourings of a random graph
• Frozen variables in random boolean constraint satisfaction problems
• On the solution-space geometry of random constraint satisfaction problems
• The two possible values of the chromatic number of a random graph
• The condensation phase transition in random graph coloring

This page was built for publication: Rigid Colorings of Hypergraphs and Contiguity