4 citations · 7 across the 7 of their papers we have counts for
14 papers
Polish space partition principles and the Halpern-Läuchli theorem
Chris Lambie-Hanson, Andy Zucker
The Halpern-Läuchli theorem, a combinatorial result about trees, admits an elegant proof due to Harrington using ideas from forcing. In an attempt to distill the combinatorial esse…
Knaster and friends III: Subadditive colorings
Chris Lambie-Hanson, Assaf Rinot
We continue our study of strongly unbounded colorings, this time focusing on subadditive maps. In Part I of this series, we showed that, for many pairs of infinite cardinals ,…
Simutaneously vanishing higher derived limits without large cardinals
Jeffrey Bergfalk, Michael Hrušák, Chris Lambie-Hanson
A question dating to Sibe Mardešić and Andrei Prasolov's 1988 work Strong homology is not additive, and motivating a considerable amount of set theoretic work in the ensuing years,…
Disjoint type graphs with no short odd cycles
Chris Lambie-Hanson
In this note, we provide a proof of a technical result of Erdős and Hajnal about the existence of disjoint type graphs with no odd cycles. We also prove that this result is sharp i…
Extremal triangle-free and odd-cycle-free colourings of uncountable graphs
Chris Lambie-Hanson, Dániel T. Soukup
The optimality of the Erdős-Rado theorem for pairs is witnessed by the colouring recording the least point of disagreement between two functions. This…
Knaster and friends II: The C-sequence number
Chris Lambie-Hanson, Assaf Rinot
Motivated by a characterization of weakly compact cardinals due to Todorcevic, we introduce a new cardinal characteristic, the C-sequence number, which can be seen as a measure of…