Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the connectivity threshold for colorings of random graphs and hypergraphs (1803.05246v2)

Published 14 Mar 2018 in math.CO, cs.DM, and math.PR

Abstract: Let $\Omega_q=\Omega_q(H)$ denote the set of proper $[q]$-colorings of the hypergraph $H$. Let $\Gamma_q$ be the graph with vertex set $\Omega_q$ and an edge ${\sigma,\tau}$ where $\sigma,\tau$ are colorings iff $h(\sigma,\tau)=1$. Here $h(\sigma,\tau)$ is the Hamming distance $|{v\in V(H):\sigma(v)\neq\tau(v)}|$. We show that if $H=H_{n,m;k},\,k\geq 2$, the random $k$-uniform hypergraph with $V=[n]$ and $m=dn/k$ then w.h.p. $\Gamma_q$ is connected if $d$ is sufficiently large and $q\gtrsim (d/\log d){1/(k-1)}$.

Summary

We haven't generated a summary for this paper yet.