相关论文: Essential Kurepa trees versus essential Jech---Kun…
We consider the two-cardinal Kurepa Hypothesis $\mathsf{KH}(\kappa,\lambda)$. We observe that if $\kappa\leq\lambda<\mu$ are infinite cardinals then…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…
For uncountable downwards closed subtrees $U$ and $W$ of an $\omega_1$-tree $T$, we say that $U$ and $W$ are strongly almost disjoint if their intersection is a finite union of countable chains. The tree $T$ is strongly non-saturated if…
With the help of various square principles, we obtain results concerning the consistency strength of several statements about trees containing ascent paths, special trees, and strong chain conditions. Building on a result that shows that…
A quasiconformal tree is a doubling (compact) metric tree in which the diameter of each arc is comparable to the distance of its endpoints. We show that for each integer $n\geq 2$, the class of all quasiconformal trees with uniform branch…
An $\mathbb R$-tree is a certain kind of metric space tree in which every point can be branching. Favre and Jonsson posed the following problem in 2004: can the class of orders underlying $\mathbb R$-trees be characterised by the fact that…
A BC-tree (block-cutpoint-tree) is a tree (with at least two vertices) where the distance between any two leaves is even. Motivated from the study of the "core" of a graph, BC-trees provide an interesting class of trees. We consider…
We show it is consistent that there is a Souslin tree $S$ such that after forcing with $S$, $S$ is Kurepa and for all clubs $C \subset \omega_1$, $S\upharpoonright C$ is rigid. This answers Fuchs's questions in Club degrees of rigidity and…
A graph is $\alpha$-excellent if every vertex of the graph is contained in some maximum independent set of the graph. In this paper, we present two characterizations of the $\alpha$-excellent $2$-trees.
Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
An edge (vertex) cut $X$ of $G$ is $r$-essential if $G-X$ has two components each of which has at least $r$ edges. A graph $G$ is $r$-essentially $k$-edge-connected (resp. $k$-connected) if it has no $r$-essential edge (resp. vertex) cuts…
An $n$-vertex graph is degree 3-critical if it has $2n - 2$ edges and no proper induced subgraph with minimum degree at least 3. In 1988, Erd\H{o}s, Faudree, Gy\'arf\'as, and Schelp asked whether one can always find cycles of all short…
Assuming the existence of a proper class of supercompact cardinals, we force that for every regular cardinal $\kappa$, there are $\kappa^+$-Aronszajn trees and all such trees are special.
The aim of this paper is to prove that for there exist a chain in the Rudin-Frol\'ik order of $\beta\kappa\setminus \kappa$ of length $\mu$ with $\kappa \leqslant \mu \leqslant 2^\kappa$ for regular $\kappa> \omega$ without a lower bound.
We show that if $\kappa < \aleph_\omega$ Cohen reals are added to a model of $\mathsf{CH}$, then there are nontrivial automorphisms of $\mathcal P(\omega)/\mathrm{Fin}$ in the extension. Under some further hypotheses on the ground model,…
Assuming the existence of a strong cardinal $\kappa$ and a measurable cardinal above it, we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any prescribed cofinality, and such that the tree property holds…
A wide Aronszajn tree is a tree of size and height $\omega_1$ with no uncountable branches. We prove that under $MA(\omega_1)$ there is no wide Aronszajn tree which is universal under weak embeddings. This solves an open question of Mekler…
When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…