1 citations · 2 across the 3 of their papers we have counts for
3 papers
math.LO2026
Bounded elementary extensions of trees with unbounded paths
Ruaan Kellerman
A tree is a partially ordered set that is downwards linear and downwards connected. A tree is called bounded when each of its paths (i.e. maximal linearly ordered subsets) contains…
math.CO2023★ 1 cited
Structural theory of trees. II. Completeness and completions of trees
Valentin Goranko, Ruaan Kellerman, Alberto Zanardo
Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dede…
math.CO2023★ 1 cited
Structural theory of trees. I. Branching and condensations of trees
Valentin Goranko, Ruaan Kellerman, Alberto Zanardo
Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of dif…