Related papers: PGL orbits in tree varieties

Let $G$ be a connected reductive group over a perfect field $k$ acting on an algebraic variety $X$ and let $P$ be a minimal parabolic subgroup of $G$. For $k$-spherical $G$-varieties we prove finiteness result for $P$-orbits that contain…

Let $G$ be a connected reductive group over an algebraically closed field $k$, and let $Fl$ be the affine flag variety of $G$. For every regular semisimple element $\gamma$ of $G(k((t)))$, the affine Springer fiber $Fl_{\gamma}$ can be…

In this paper we show how to find nearly optimal embeddings of large trees in several natural classes of graphs. The size of the tree T can be as large as a constant fraction of the size of the graph G, and the maximum degree of T can be…

The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study the product dimension of forests, bounded treewidth graphs and…

A classical result of Koml\'os, S\'ark\"ozy and Szemer\'edi states that every $n$-vertex graph with minimum degree at least $(1/2+ o(1))n$ contains every $n$-vertex tree with maximum degree $O(n/\log{n})$ as a subgraph, and the bounds on…

Let $\FN$ be a free group of finite rank $N \geq 2$, and let $T$ be an $\R$-tree with a very small, minimal action of $\FN$ with dense orbits. For any basis $\CA$ of $\FN$ there exists a {\em heart} $K_{\CA} \subset \bar T$ (= the metric…

In the first half of this article, we review the Steinberg theory for double flag varieties for symmetric pairs. For a special case of the symmetric space of type AIII, we will consider $ X = GL_{2n}/P_{(n,n)} \times GL_n / B_n^+ \times…

The classical Ehresmann-Bruhat order describes the possible degenerations of a pair of flags in a linear space V under linear transformations of V; or equivalently, it describes the closure of an orbit of GL(V) acting diagonally on the…

We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…

This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…

Klimo\v{s}ov\'a, Piguet, and Rozho\v{n} conjectured that any graph with minimum degree $k/2$ and sufficiently many vertices of degree $k$ should contain all trees with $k$ edges. We prove an asymptotic version of this conjecture for dense…

We study the problem of maximizing the number of full degree vertices in a spanning tree $T$ of a graph $G$; that is, the number of vertices whose degree in $T$ equals its degree in $G$. In cubic graphs, this problem is equivalent to…

We consider special cases of the two tree degree sequences problem. We show that if two tree degree sequences do not have common leaves then they always have edge-disjoint caterpillar realizations. By using a probabilistic method, we prove…

Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of…

Matsuki and Oshima introduced the notion of clans, which are incomplete matchings with positive or negative signs on isolated vertices. They discovered that clans parametrise $K$-orbits in the flag varieties for classical linear groups,…

Wu, Zhang and Li [4] conjectured that the set of vertices of any simple graph $G$ can be equitably partitioned into $\lceil(\Delta(G)+1)/2\rceil$ subsets so that each of them induces a forest of $G$. In this note, we prove this conjecture…

We investigate the $CR$ geometry of the orbits $M$ of a real form $G_0$ of a complex simple group $G$ in a complex flag manifold $X=G/Q$. We are mainly concerned with finite type, Levi non-degeneracy conditions, canonical $G_0$-equivariant…

Nikiforov (LAA, 2010) conjectured that for given integer $k$, any graph $G$ of sufficiently large order $n$ with spectral radius $\mu(G)\geq \mu(S_{n,k})$ contains all trees of order $2k+2$, unless $G=S_{n,k}$, where $S_{n,k}=K_k\vee…

We focus on counting the number of labeled graphs on $n$ vertices and treewidth at most $k$ (or equivalently, the number of labeled partial $k$-trees), which we denote by $T_{n,k}$. So far, only the particular cases $T_{n,1}$ and $T_{n,2}$…

We consider the probability that a spanning tree chosen uniformly at random from a graph can be partitioned into a fixed number $k$ of trees of equal size by removing $k-1$ edges. In that case, the spanning tree is called {\em splittable}.…