In this paper we aim to compare Kurepa trees and Aronszajn trees. Moreover, we analyze the effect of large cardinal assumptions on this comparison. Using the the method of walks on ordinals, we will show it is consistent with ZFC that there is a Kurepa tree and every Kurepa tree contains an Aronszajn subtree, if there is an inaccessible cardinal. This is stronger than Komjath's theorem in [5], where he proves the same consistency from two inaccessible cardinals. Moreover, we prove it is consistent with ZFC that there is a Kurepa tree T such that if U⊂T is a Kurepa tree with the inherited order from T, then U has an Aronszajn subtree. This theorem uses no large cardinal assumption. Our last theorem immediately implies the following: If MAω2 holds and ω2 is not a Mahlo cardinal in then there is a Kurepa tree with the property that every Kurepa subset has an Aronszajn subtree. Our work entails proving a new lemma about Todorcevic's ρ function which might be useful in other contexts.

Abstract We will show it is consistent with GCH that there is a minimal non-σ-scattered linear order which does not contain any real or Aronszajn type. In particular the assumption PFA+ in the main result of [5] is necessary, and there are other obstructions than real and Aronszajn types to the sharpness of Laver’s theorem in [8].