Related papers: Combinatorial properties of triplet covers for bin…

An N -tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile". The tile may or may not be similar to ABC . We wish to…

We discuss metric and combinatorial properties of Thompson's group T, including normal forms for elements and unique tree pair diagram representatives. We relate these properties to those of Thompson's group F when possible, and highlight…

This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…

Let $G$ be a 3-connected planar graph. Define the co-tree of a spanning tree $T$ of $G$ as the graph induced by the dual edges of $E(G)-E(T)$. The well-known cut-cycle duality implies that the co-tree is itself a tree. Let a $k$-tree be a…

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…

A hypergraph $\mathcal{H}=(V,\mathcal{E})$ is a hypertree if it admits a tree $T$ with vertex set $V$ such that every edge of $\mathcal{H}$ induces a subtree of $T$. A tree like that is called a host tree. Several characterizations and…

This study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees ("Otter trees"), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size $n$ is proved to…

The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.

This is a survey article written for the Jahresberichte der DMV. Tropical geometry can be viewed as an efficient combinatorial tool to study degenerations in algebraic geometry. Abstract tropical curves are essentially metric graphs, and…

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…

This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a…

Rotation distance between rooted binary trees is the minimum number of simple rotations needed to transform one tree into the other. Computing the rotation distance between a pair of rooted trees can be quickly reduced in cases where there…

Deciding whether there is a single tree -a supertree- that summarizes the evolutionary information in a collection of unrooted trees is a fundamental problem in phylogenetics. We consider two versions of this question: agreement and…

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…

This paper considers the conjecture by Gr\"unbaum that every planar 3-connected graph has a spanning tree $T$ such that both $T$ and its co-tree have maximum degree at most 3. Here, the co-tree of $T$ is the spanning tree of the dual…

Tropical geometry with the max-plus algebra has been applied to statistical learning models over tree spaces because geometry with the tropical metric over tree spaces has some nice properties such as convexity in terms of the tropical…

We present a systematic study of threefolds fibred by K3 surfaces that are mirror to sextic double planes. There are many parallels between this theory and the theory of elliptic surfaces. We show that the geometry of such threefolds is…

A strengthened version of Harborth's well-known conjecture -- known as Kleber's conjecture -- states that every planar graph admits a planar straight-line drawing where every edge has integer length and each vertex is restricted to the…

We prove that every connected graph with $s$ vertices of degree~1 and 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${1\over 3}t +{1\over 4}s+{3\over 2}$ leaves. We present infinite series of graphs showing that…

Let f : X -> S be any elliptic fibration. If X has dimension 3 and is not uniruled, then X has a minimal model (with terminal singularities) [Mori]. In earlier work we have shown that there exists a birationally equivalent elliptic…