Related papers: Shotgun reconstruction in the hypercube
The graph projection of a hypergraph is a simple graph with the same vertex set and with an edge between each pair of vertices that appear in a hyperedge. We consider the problem of reconstructing a random $d$-uniform hypergraph from its…
We consider the problem of $2$-coloring geometric hypergraphs. Specifically, we show that there is a constant $m$ such that any finite set of points in the plane $\mathcal{S} \subset {\mathbb R}^2$ can be $2$-colored such that every…
We consider the problem of $q$-colouring a $k$-uniform random hypergraph, where $q,k \geq 3$, and determine the rigidity threshold. For edge densities above the rigidity threshold, we show that almost all solutions have a linear number of…
We analyse the performance of simple distributed colouring algorithms under the assumption that the input graph is a hyperbolic random graph (HRG), a generative model capturing key properties of real-world networks such as power-law degree…
In a recent paper [6], J. Gaudio and E. Mossel studied the shotgun assembly of the Erd\H{o}s-R\'enyi graph $\mathcal G(n,p_n)$ with $p_n=n^{-\alpha}$, and showed that the graph is reconstructable form its $1$-neighbourhoods if $0<\alpha <…
One of the fundamental and most-studied algorithmic problems in distributed computing on networks is graph coloring, both in bounded-degree and in general graphs. Recently, the study of this problem has been extended in two directions.…
Given two colorings of a graph, we consider the following problem: can we recolor the graph from one coloring to the other through a series of elementary changes, such that the graph is properly colored after each step? We introduce the…
Consider a $d$-uniform random hypergraph on $n$ vertices in which hyperedges are included iid so that the average degree is $n^\delta$. The projection of a hypergraph is a graph on the same $n$ vertices where an edge connects two vertices…
The reconfiguration graph $R_k(G)$ for the $k$-colorings of a graph $G$ has as vertex set the set of all possible $k$-colorings of $G$ and two colorings are adjacent if they differ in the color of exactly one vertex of $G$. Let $d, k \geq…
Deterministic fabrication of random metamaterials requires filling of a space with randomly oriented and randomly positioned chords with an on-average homogenous density and orientation, which is a nontrivial task. We describe a method to…
We study in this paper the structure of solutions in the random hypergraph coloring problem and the phase transitions they undergo when the density of constraints is varied. Hypergraph coloring is a constraint satisfaction problem where…
The problem of vertex coloring in random graphs is studied using methods of statistical physics and probability. Our analytical results are compared to those obtained by exact enumeration and Monte-Carlo simulations. We critically discuss…
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a multiset are obtained by replacing a pair of its elements by their sum. Necessary and sufficient conditions for the reconstructibility of…
The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any $n$-uniform simple (i.e. every two distinct edges share at most one vertex) hypergraph $H$ with maximum edge…
In this paper, we show that for every graph of maximum average degree bounded away from $d$, any $(d+1)$-coloring can be transformed into any other one within a polynomial number of vertex recolorings so that, at each step, the current…
In responding to a question on Math Stackexchange, the author formulated the problem of determining the number of strings of balls colored in most $n$ colors with a number $k$ of repeated colors. In this paper, we formulate the problem more…
We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. We obtain a tight bound on the number of random edges required to ensure…
We study several basic problems about colouring the $p$-random subgraph $G_p$ of an arbitrary graph $G$, focusing primarily on the chromatic number and colouring number of $G_p$. In particular, we show that there exist infinitely many…
For a hypergraph $H$, let $q(H)$ denote the expected number of monochromatic edges when the color of each vertex in $H$ is sampled uniformly at random from the set of size 2. Let $s_{\min}(H)$ denote the minimum size of an edge in $H$.…
Feder and Subi conjectured that for any $2$-coloring of the edges of the $n$-dimensional cube, we can find an antipodal pair of vertices connected by a path that changes color at most once. We discuss the case of random colorings, and we…