Related papers: PGL orbits in tree varieties

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…

We consider packing tree degree sequences in this paper. We set up a conjecture that any arbitrary number of tree degree sequences without common leaves have edge disjoint tree realizations. This conjecture is known to be true for $2$ and…

The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…

We prove that every connected graph with $s$ vertices of degree not 2 has a spanning tree with at least ${1\over 4}(s-2)+2$ leaves. Let $G$ be a be a connected graph of girth $g$ with $v>1$ vertices. Let maximal chain of successively…

We extend the result of Fannes, Nachtergaele, and Werner on long-range order in the AKLT model on Cayley trees to include various trees and tree-like graphs that obey certain conditions. Our examples split into three cases: Cayley-like…

Given a symmetric pair $(G,K)=(\mathrm{GL}_{p+q}(\mathbb{C}),\mathrm{GL}_{p}(\mathbb{C})\times \mathrm{GL}_{q}(\mathbb{C}))$ of type AIII, we consider the diagonal action of $K$ on the double flag variety…

In this paper, we develop a new method to produce explicit formulas for the number $f_{G}(n)$ of rooted spanning forests in the circulant graphs $ G=C_{n}(s_1,s_2,\ldots,s_k)$ and $ G=C_{2n}(s_1,s_2,\ldots,s_k,n).$ These formulas are…

We present a nice result on the probability of a cycle occurring in a randomly generated graph. We then provide some extensions and applications, including the proof of the famous Cayley formula, which states that the number of labeled…

Let $G$ be a split semisimple linear algebraic group over a field and let $X$ be a generic twisted flag variety of $G$. Extending the Hilbert basis techniques to Laurent polynomials over integers we give an explicit presentation of the…

A proper vertex of a rooted tree with totally ordered vertices is a vertex that is less than all its proper descendants. We count several kinds of labeled rooted trees and forests by the number of proper vertices. Our results are all…

A graph is a $k$-leaf power of a tree $T$ if its vertices are leaves of $T$ and two vertices are adjacent in $T$ if and only if their distance in $T$ is at most $k$. Then $T$ is a $k$-leaf root of $G$. This notion was introduced by…

The generalized degree polynomial $\mathbf{G}_T(x,y,z)$ of a tree $T$ is an invariant introduced by Crew that enumerates subsets of vertices by size and number of internal and boundary edges. Aliste-Prieto et al. proved that $\mathbf{G}_T$…

We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…

Let $T$ be an oriented tree on $n$ vertices with maximum degree at most $e^{o(\sqrt{\log n})}$. If $G$ is a digraph on $n$ vertices with minimum semidegree $\delta^0(G)\geq(\frac12+o(1))n$, then $G$ contains $T$ as a spanning tree, as…

We show, under natural conditions, that uniform rooted trees with fixed degree sequence converge after renormalization toward inhomogeneous continuum random trees (ICRT). We also provide a sharp upper-bound for the tail of their heights. We…

We apply a theorem of Gel'fand, Goresky, MacPherson, and Serganova about matroid polytopes to study semistability of partial flags relative to a T-linearized ample line bundle of a flag space F = SL(n)/P where T is a maximal torus in SL(n)…

Let G be a semisimple affine algebraic group and P a parabolic subgroup of G. We classify all flag varieties G/P which admit an action of the commutative unipotent group G_a^n with an open orbit.

Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…

Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H in F is contained in G as a subgraph. The construction of sparse universal graphs for various families F has received a considerable amount of…

The classical Ehresmann-Bruhat order describes the possible degenerations of a pair of flags in a finite-dimensional vector space V; or, equivalently, the closure of an orbit of the group GL(V) acting on the direct product of two full flag…