Related papers: Subtrees of a Given size in Schroeder Trees

We find a simple, closed formula for the proportion of vertices which are $k$-protected in all unlabeled rooted plane trees on $n$ vertices. We also find that, as $n$ goes to infinity, the average rank of a random vertex in a tree of size…

Given a multiparameter filtration of simplicial complexes, we consider the problem of explicitly constructing generators for the multipersistent homology groups with arbitrary PID coefficients. We propose the use of spanning trees as a tool…

Motivated by the question of how macromolecules assemble, the notion of an {\it assembly tree} of a graph is introduced. Given a graph $G$, the paper is concerned with enumerating the number of assembly trees of $G$, a problem that applies…

We introduce and study a new notion of patterns in Stirling and $k$-Stirling permutations, which we call block patterns. We prove a general result which allows us to compute generating functions for the occurrences of various block patterns…

Let $K/k$ be a finite extension of a global field. Such an extension can be generated over $k$ by a single element. The aim of this article is to prove the existence of a "small" generator in the function field case. This answers the…

Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we presented sub-tree based upper and lower bounds on the partition…

We present a new characterization of $k$-trees based on their reduced clique graphs and $(k+1)$-line graphs, which are block graphs. We explore structural properties of these two classes, showing that the number of clique-trees of a…

Generating graphs from a target distribution is a significant challenge across many domains, including drug discovery and social network analysis. In this work, we introduce a novel graph generation method leveraging $K^2$-tree…

We revisit the \textsc{$k$-Secluded Tree} problem. Given a vertex-weighted undirected graph $G$, its objective is to find a maximum-weight induced subtree $T$ whose open neighborhood has size at most $k$. We present a fixed-parameter…

We study Jacobi matrices on trees whose coefficients are generated by multiple orthogonal polynomials. Hilbert space decomposition into an orthogonal sum of cyclic subspaces is obtained. For each subspace, we find generators and the…

If X is an n-element set, we call a family G of subsets of X a k-generator for X if every subset of X can be expressed as a union of at most k disjoint sets in G. Frein, Leveque and Sebo conjectured that for n > 2k, the smallest…

For all integers $k\geq 3$, we give an $O(n^4)$ time algorithm for the problem whose instance is a graph $G$ of girth at least $k$ together with $k$ vertices and whose question is "Does $G$ contains an induced subgraph containing the $k$…

We determine the probability that a random k-dimensional subspace of Euclidean n-space contains a positive vector.

We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…

A Skolem sequence is a linear arrangement of the multiset, {1, 1, 2, 2, ..., n, n} such that if r in [n] appears in positions i and j, then |i-j| = r. We first translate the problem to a particular set of perfect matchings, then apply the…

The recursive and hierarchical structure of full rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. In most of these cases, the full rooted tree is…

We prove a lower bound on the number of spanning two-forests in a graph, in terms of the number of vertices, edges, and spanning trees. This implies an upper bound on the average cut size of a random two-forest. The main tool is an identity…

We compute the total number of spanning trees for the generalized cone of the complete graph $K_n$ and a number of families of some modified bipartite graphs $K_{m,n}$. In particular, we obtain a new method of finding the number of spanning…

An algorithm is proposed for constructing directed spanning forests of the minimum weight, in which the maximum possible degree of affinity between the minimum forests is preserved when the number of trees changes. The correctness of the…

Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…