Related papers: Uniqueness thresholds on trees versus graphs
Bernshteyn and Lee defined a new notion, weak degeneracy, which is slightly weaker than the ordinary degeneracy. It is proved that strictly $f$-degenerate transversal is a common generalization of list coloring, $L$-forested-coloring and…
We consider a class of weakly interacting particle systems of mean-field type. The interactions between the particles are encoded in a graph sequence, i.e., two particles are interacting if and only if they are connected in the underlying…
A behavior of extreme networks under deformations of their boundary sets is investigated. It is shown that analyticity of a deformation of boundary set guarantees preservation of the networks types for minimal spanning trees, minimal…
A graph G=(V,E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers `d' and `D' such that each leaf `u' of T is a node of V and the edge `(u,v) belongs to E' iff `d <= d_T(u, v)…
We consider interacting particle systems with unbounded interaction range on general countably infinite graphs $S$ and prove explicit non-asymptotic error bounds for approximations of the infinite-volume dynamics by systems of finitely many…
We study spatial decay properties of sensitivities in a nonlinear optimal control problem with a graph-structured interaction topology. For a problem with nonlinear decoupled dynamics and quadratic cost, we show that a perturbation of the…
We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.
This survey concerns regular graphs that are extremal with respect to the number of independent sets, and more generally, graph homomorphisms. More precisely, in the family of of $d$-regular graphs, which graph $G$ maximizes/minimizes the…
Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…
Extremal problems related to the enumeration of graph substructures, such as independent sets, matchings, and induced matchings, have become a prominent area of research with the advancement of graph theory. A subset of vertices is called a…
Building on work by Desjarlais, Molina, Faase, and others, a general method is obtained for counting the number of spanning trees of graphs that are a product of an arbitrary graph and either a path or a cycle, of which grid graphs are a…
The study of critical properties of systems with long-range interactions has attracted in the last decades a continuing interest and motivated the development of several analytical and numerical techniques, in particular in connection with…
Exceptional points are special degeneracy points in parameter space that can arise in (effective) non-Hermitian Hamiltonians describing open quantum and wave systems. At an n-th order exceptional point, n eigenvalues and the corresponding…
We consider the problem of graph matchability in non-identically distributed networks. In a general class of edge-independent networks, we demonstrate that graph matchability can be lost with high probability when matching the networks…
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…
A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We…
The element distinctness problem takes as input a list $I$ of $n$ values from a totally ordered universe and the goal is to decide whether $I$ contains any duplicates. It is a well-studied problem with a classical worst-case $\Omega(n \log…
Consider the nearest neighbor graph for the integer lattice Z^d in d dimensions. For a large finite piece of it, consider choosing a spanning tree for that piece uniformly among all possible subgraphs that are spanning trees. As the piece…
Bispanning graphs are undirected graphs with an edge set that can be decomposed into two disjoint spanning trees. The operation of symmetrically swapping two edges between the trees, such that the result is a different pair of disjoint…
We study the joint asymptotic behavior of spacings between particles at the edge of multilevel Dyson Brownian motions, when the number of levels tends to infinity. Despite the global interactions between particles in multilevel Dyson…