相关论文: On the relation between weighted trees and tropica…

For a labelled tree on the vertex set $[n]:=\{1,2,..., n\}$, define the direction of each edge $ij$ to be $i\to j$ if $i<j$. The indegree sequence of $T$ can be considered as a partition $\lambda \vdash n-1$. The enumeration of trees with a…

We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding…

We consider the description of reggeon amplitudes (Wilson lines form factors) in N=4 SYM within the framework of four dimensional ambitwistor string theory. The latter is used to derive scattering equations representation for reggeon…

In this paper, the tropical Nevanlinna theory is extended for piecewise polynomial continuous functions. By constructing the $n$-th Poisson-Jensen formula, the $n$-th tropical counting, proximity, and characteristic functions are…

Connection of the Four Color Theorem (FCT) with some operations on trees is described. L.H. Kauffman's theorem about FCT and vector cross product is discussed. Operation of transplantation on trees linked with the move of brackets according…

In analogy to other concepts of a similar nature, we define the inducibility of a rooted binary tree. Given a fixed rooted binary tree $B$ with $k$ leaves, we let $\gamma(B,T)$ be the proportion of all subsets of $k$ leaves in $T$ that…

We compare the phylogenetic tensors for various trees and networks for two, three and four taxa. If the probability spaces between one tree or network and another are not identical then there will be phylogenetic tensors that could have…

We investigate the tree gonality of a genus-$g$ metric graph, defined as the minimum degree of a tropical morphism from any tropical modification of the metric graph to a metric tree. We give a combinatorial constructive proof that this…

We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…

There is an unproven duality theory hypothesizing that random discrete trees and their poissonized embeddings in continuous time share fundamental properties. We give additional evidence in favor of this theory by showing that several…

We prove a Matrix-Tree Theorem enumerating the spanning trees of a cell complex in terms of the eigenvalues of its cellular Laplacian operators, generalizing a previous result for simplicial complexes. As an application, we obtain explicit…

In this paper, we consider weighted counts of tropical plane curves of particular combinatorial type through a certain number of generic points. We give a criterion, derived from tropical intersection theory on the secondary fan, for a…

In this paper, we prove that every $n$-vertex connected $K_{1,5}$-free graph $G$ with $\sigma_4(G)\geq n-1$ contains a spanning tree with at most $5$ leaves and branch vertices in total. Moreover, the degree sum condition "$\sigma_4(G)\geq…

We introduce a certain class of 2-type Galton-Watson trees with edge lengths. We prove that, after an adequate rescaling, the weighted height function of a forest of such trees converges in law to the reflected Brownian motion. We then use…

The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…

A k-dissimilarity D on a finite set X, |X| >= k, is a map from the set of size k subsets of X to the real numbers. Such maps naturally arise from edge-weighted trees T with leaf-set X: Given a subset Y of X of size k, D(Y) is defined to be…

We investigate a new algebra-based approach of finding Grassmannian formulas for scattering amplitudes. Our prime motivation is massive amplitudes of 4D $\mathcal{N}=4$ SYM, and therefore we consider a 6D Grassmannian formula, where we can…

Observables in random tensor theory are polynomials in the entries of a tensor of rank $d$ which are invariant under $U(N)^d$. It is notoriously difficult to evaluate the expectations of such polynomials, even in the Gaussian distribution.…

We prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph. Our result confirms, for…

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…