相关论文: Boundary Partitions in Trees and Dimers

We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures…

We prove a nonuniqueness theorem for Bernoulli site percolation on properly embedded planar graphs, and we obtain a general connectivity principle beyond planarity. Let $G$ be an infinite connected graph properly embedded in $\RR^2$ with…

We consider the dimer model on piecewise Temperleyan, simply connected domains, on families of graphs which include the square lattice as well as superposition graphs. We focus on the spanning tree $\mathcal{T}_\delta$ associated to this…

We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we…

We solve a problem of Krivelevich, Kwan and Sudakov [SIAM Journal on Discrete Mathematics 31 (2017), 155-171] concerning the threshold for the containment of all bounded degree spanning trees in the model of randomly perturbed dense graphs.…

Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often complex and burdensome. We introduce a four-part logical split:…

We explore a generating function trick which allows us to keep track of infinitely many statistics using finitely many variables, by recording their individual distributions rather than their joint distributions. Building on previous work…

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs classes with set representation characterisations. The complexity of recognising SOGs in open. The complexities of recognising many subclasses of SOGs are known.…

Let $\mathcal{G}_{n,r,s}$ denote a uniformly random $r$-regular $s$-uniform hypergraph on the vertex set $\{1,2,\ldots, n\}$. We establish a threshold result for the existence of a spanning tree in $\mathcal{G}_{n,r,s}$, restricting to $n$…

We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence $\boldsymbol{d}=(d_1,\ldots, d_n)$, provided that the number of edges is at least $n + \textstyle{\frac{1}{2}}…

Let $G$ be a 3-connected planar graph. Define the co-tree of a spanning tree $T$ of $G$ as the graph induced by the dual edges of $E(G)-E(T)$. The well-known cut-cycle duality implies that the co-tree is itself a tree. Let a $k$-tree be a…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

The Ferrers bound conjecture is a natural graph-theoretic extension of the enumeration of spanning trees for Ferrers graphs. We document the current status of the conjecture and provide a further conjecture which implies it.

We derive a message passing method for computing the spectra of locally tree-like networks and an approximation to it that allows us to compute closed-form expressions or fast numerical approximates for the spectral density of random graphs…

We study multiport networks, common in electrical engineering. They have boundary conditions different from electrical networks: the boundary vertices are split into pairs and the sum of the incoming currents is set to be zero in each pair.…

A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously. In this paper, we focus on complete bipartite…

We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…

Phylogenetic trees and networks are leaf-labelled graphs used to model evolution. Display graphs are created by identifying common leaf labels in two or more phylogenetic trees or networks. The treewidth of such graphs is bounded as a…

We present a general result which shows that the winding of the branches in a uniform spanning tree on a planar graph converge in the limit of fine mesh size to a Gaussian free field. The result holds true assuming only convergence of…