Related papers: Sandpiles, spanning trees, and plane duality

Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…

Let $H$ be a subgroup of a finite non-abelian group $G$ and $g \in G$. Let $Z(H, G) = \{x \in H : xy = yx, \forall y \in G\}$. We introduce the graph $\Delta_{H, G}^g$ whose vertex set is $G \setminus Z(H, G)$ and two distinct vertices $x$…

A $(1+\varepsilon)$-stretch tree cover of an edge-weighted $n$-vertex graph $G$ is a collection of trees, where every pair of vertices has a $(1+\varepsilon)$-stretch path in one of the trees. The celebrated Dumbbell Theorem by Arya et. al.…

For a finite group $G$, $G$-transfer systems are combinatorial objects which encode the homotopy category of $G$-$N_\infty$ operads, whose algebras in $G$-spectra are $E_\infty$ $G$-spectra with a specified collection of multiplicative…

Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one of these on an adjacent vertex. We introduce the notion of…

Let $K$ be a finite group and let $G$ be a finite group acting on $K$ by automorphisms. In this paper we study two different but intimately related subjects: on the one side we classify all possible multiplicative and associative structures…

A caterpillar tree is a connected, acyclic, graph in which all vertices are either a member of a central path, or joined to that central path by a single edge. In other words, caterpillar trees are the class of trees which become path…

The class ${\cal L}_k$ of $k$-leaf powers consists of graphs $G=(V,E)$ that have a $k$-leaf root, that is, a tree $T$ with leaf set $V$, where $xy \in E$, if and only if the $T$-distance between $x$ and $y$ is at most $k$. Structure and…

We consider questions related to the existence of spanning trees in graphs with the property that after the removal of any path in the tree the graph remains connected. We show that, for planar graphs, the existence of trees with this…

We introduce a class of automorphisms of rooted $d$-regular trees arising from affine actions on their boundaries viewed as infinite dimensional vector spaces. This class includes, in particular, many examples of self-similar realizations…

Given a topological group $ G $ and a Hausdorff topological group $ A $ on which $ G $ acts continuously and compatibly with the group operation of $ A $, we study the set of continuous cocycles of $ G $ with value in $ A $. This set is a…

We study $(G,2)$-arc-transitive graphs for innately transitive permutation groups $G$ such that $G$ can be embedded into a wreath product $\sym\Gamma\wr\sy\ell$ acting in product action on $\Gamma^\ell$. We find two such connected graphs:…

We give a new simple construction of the sandpile measure on an infinite graph G, under the sole assumption that each tree in the Wired Uniform Spanning Forest on G has one end almost surely. For, the so called, generalized minimal…

We consider the existence of bibundles, in other words locally trivial principal $G$ spaces with commuting left and right $G$ actions. We show that their existence is closely related to the structure of the group $\Out(G)$ of outer…

Let $C_t$ be a cycle of length $t$, and let $P_1,\ldots,P_t$ be $t$ polygon chains. A polygon flower $F=(C_t; P_1,\ldots,P_t)$ is a graph obtained by identifying the $i$th edge of $C_t$ with an edge $e_i$ that belongs to an end-polygon of…

Let $G$ be a nonabelian group, $A\subseteq G$ an abelian subgroup and $n\geqslant 2$ an integer. We say that $G$ has an $n$-abelian partition with respect to $A$, if there exists a partition of $G$ into $A$ and $n$ disjoint commuting…

A drawing of a graph $G$ is radial if the vertices of $G$ are placed on concentric circles $C_1, \ldots, C_k$ with common center $c$, and edges are drawn radially: every edge intersects every circle centered at $c$ at most once. $G$ is…

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. For a graph G with a certain reflective symmetry, we generalize a result of Ciucu-Yan-Zhang factorizing the spanning tree…

In the homomorphism order of digraphs, a duality pair is an ordered pair of digraphs $(G,H)$ such that for any digraph, $D$, $G\to D$ if and only if $D\not\to H$. The directed path on $k+1$ vertices together with the transitive tournament…

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…