相关论文: How special is your Aronszajn tree?
We analyze a countable support product of a free Suslin tree which turns it into a highly rigid Kurepa tree with no Aronszajn subtree. In the process, we introduce a new rigidity property for trees, which says roughly speaking that any…
It implicitly follows from the work of [Colbourn, El-Mallah: On two dual classes of planar graphs. Discrete Mathematics 80(1): 21-40 (1990)] that every planar partial 3-tree is a subgraph of a planar 3-tree. This fact has already enabled to…
We consider strong combinatorial principles for sigma-directed families of countable sets in the ordering by inclusion modulo finite, e.g. P-ideals of countable sets. We try for principles as strong as possible while remaining compatible…
Motivated by the work of Lov\'asz and Szegedy on the convergence and limits of dense graph sequences, we investigate the convergence and limits of finite trees with respect to sampling in normalized distance. Based on separable real trees,…
In this paper we consider a notion of nonmeasurablity with respect to Marczewski and Marczewski-like tree ideals $s_0$, $m_0$, $l_0$, and $cl_0$. We show that there exists a subset $A$ of the Baire space $\omega^\omega$ which is $s$-, $l$-,…
Let $\T_{n}$ be the set of rooted labeled trees on $\set{0,...,n}$. A maximal decreasing subtree of a rooted labeled tree is defined by the maximal subtree from the root with all edges being decreasing. In this paper, we study a new…
We fix an excellent regular noetherian scheme $S$ over ${\mathbf Z}_{(p)}$ satisfying a certain finiteness condition. For a constructible \'etale sheaf ${\cal F}$ on a regular scheme $X$ of finite type over $S$, we introduce a variant of…
We study the structure of trees minimizing their number of stable sets for given order $n$ and stability number $\alpha$. Our main result is that the edges of a non-trivial extremal tree can be partitioned into $n-\alpha$ stars, each of…
Assuming the existence of a Mahlo cardinal, we construct a model in which there exists an $\omega_2$-Aronszajn tree, the $\omega_1$-approachability property fails, and every stationary subset of $\omega_2 \cap \mathrm{cof}(\omega)$…
A famous conjecture of Erd\H{o}s and S\'os states that every graph with average degree more than $k - 1$ contains all trees with $k$ edges as subgraphs. We prove that the Erd\H{o}s-S\'os conjecture holds approximately, if the size of the…
We investigate the effective resistance $R_n$ and conductance $C_n$ between the root and leaves of a binary tree of height $n$. In this electrical network, the resistance of each edge $e$ at distance $d$ from the root is defined by…
We introduce and study a multiplicative analogue of additive indecomposability for linear order types that we call untranscendability, as well as a strengthening that we call $s$-untranscendability. We show that, with the unique exception…
It follows from a classical result of Jordan that every tree with maximum degree at most $r$ containing a vertex set labeled by $[n]$, has a single-edge cut which separates two subsets $A,B \subset [n]$ for which $\min\{|A|,|B|\} \ge…
Exceptional sequences are fundamental to investigate the derived categories of finite dimensional algebras. The aim of this note is to classify all the complete exceptional sequences over the path algebra of a Dynkin quiver of type $A_n$ in…
We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…
Trees fill many extremal roles in graph theory, being minimally connected and serving a critical role in the definition of $n$-good graphs. In this article, we consider the generalization of trees to the setting of $r$-uniform hypergraphs…
Starting from a stationary set of supercompact cardinals we find a generic extension in which the tree property holds at every regular cardinal between $\aleph_2$ and $\aleph_{\omega^2}$.
We show that the existence of a Suslin tree does not necessarily imply that there are uncountable minimal linear orders other than $\omega_1$ and $-\omega_1$, answering a question of J. Baumgartner. This is done by a Jensen-type iteration,…
In this paper we prove that the existence of absolutely continuous spectrum of the Kirchhoff Laplacian on a radial metric tree graph together with a finite complexity of the geometry of the tree implies that the tree is in fact eventually…
We consider linear systems on toric varieties of any dimension, with invariant base points, giving a characterization of special linear systems. We then make a new conjecture for linear systems on rational surfaces.