Related papers: On the Pebbling Threshold Spectrum
For a given undirected graph $G$, an \emph{ordered} subset $S = {s_1,s_2,...,s_k} \subseteq V$ of vertices is a resolving set for the graph if the vertices of the graph are distinguishable by their vector of distances to the vertices in…
A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is contained in one of the 3-balls bounded by the 2-sphere. We…
Answering a question of Benjamini & Schramm [8], we show that the Poisson boundary of any planar, uniquely absorbing (e.g. one-ended and transient) graph with bounded degrees can be realised geometrically as a circle, namely as the boundary…
A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. The authors recently proved a conjecture of McDiarmid, Steger, and…
Theoretical analyses for graph learning methods often assume a complete observation of the input graph. Such an assumption might not be useful for handling any-size graphs due to the scalability issues in practice. In this work, we develop…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We show that every planar graph without cycles of length 4 or 5 is…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
We define three new pebbling parameters of a connected graph $G$, the $r$-, $g$-, and $u$-critical pebbling numbers. Together with the pebbling number, the optimal pebbling number, the number of vertices $n$ and the diameter $d$ of the…
A set of colored graphs are compatible, if for every color $i$, the number of vertices of color $i$ is the same in every graph. A simultaneous embedding of $k$ compatibly colored graphs, each with $n$ vertices, consists of $k$ planar…
The \textit{node reliability} of a graph $G$ is the probability that at least one node is operational and that the operational nodes can all communicate in the subgraph that they induce, given that the edges are perfectly reliable but each…
We prove that $(1+o(1))\sqrt{e/n}$ is the sharp threshold for the appearance of the square of a Hamilton cycle in $G(n,p)$, confirming the conjecture of Kahn, Narayanan, and Park. We also find the exact asymptotics of the threshold for the…
We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…
In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…
Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is…
In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colors. The bound relates both numbers using power of 2, while…
The paper contains a simplified and improved version of the results obtained by the authors earlier. Wave propagation is discussed in a network of branched thin wave guides when the thickness vanishes and the wave guides shrink to a one…
We present quantum graphs with remarkably regular spectral characteristics. We call them {\it regular quantum graphs}. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly…
We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…