6 citations · 20 across the 19 of their papers we have counts for
27 papers
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…
Reducing the dichromatic number via cycle reversions in infinite digraphs
Paul Ellis, Attila Joó, Dániel T. Soukup
We prove the following conjecture of S. Thomassé: for every (potentially infinite) digraph it is possible to iteratively reverse directed cycles in such a way that the dichro…
On the complexity of classes of uncountable structures: trees on
Sy-David Friedman, Dániel T. Soukup
We analyse the complexity of the class of (special) Aronszajn, Suslin and Kurepa trees in the projective hierarchy of the higher Baire-space . First, we will show that n…
Towers and gaps at uncountable cardinals
Vera Fischer, Diana Carolina Montoya, Jonathan Schilhan +1
Our goal is to study the pseudo-intersection and tower numbers on uncountable regular cardinals, whether these two cardinal characteristics are necessarily equal, and related probl…
A 0-dimensional, Lindelöf space that is not strongly D
Daniel T. Soukup, Paul J. Szeptycki
A topological space is strongly if for any neighbourhood assignment , there is a such that covers and is locally fin…
Ladder system uniformization on trees I & II
Dániel T. Soukup
Given a tree of height , we say that a ladder system colouring has a -uniformization if there is a function defined on a subtree of s…