Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Dániel T. Soukup"'
Autor:
Dániel T. Soukup, Sy-David Friedman
Publikováno v:
Fundamenta Mathematicae. 253:175-196
We analyse the complexity of the class of (special) Aronszajn, Suslin and Kurepa trees in the projective hierarchy of the higher Baire-space $\omega_1^{\omega_1}$. First, we will show that none of these classes have the Baire property (unless they ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f6fe1e9f04d3bffdaa2e217ce4cf7fb0
https://doi.org/10.4064/fm910-6-2020
https://doi.org/10.4064/fm910-6-2020
Autor:
Dániel T. Soukup
Publikováno v:
Israel Journal of Mathematics. 233:199-224
We show that the existence of a Suslin tree does not necessarily imply that there are uncountable minimal linear orders other than ω1 and −ω1, answering a question of J. Baumgartner. This is done by a Jensen-type iteration, proving that one can f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6452faf2dd1a2d50a0f051821a72a091
https://doi.org/10.1007/s11856-019-1899-x
https://doi.org/10.1007/s11856-019-1899-x
Publikováno v:
Journal of Combinatorial Theory, Series B
Our goal is to investigate a common relative of the independent transversal problem and the Dushnik–Erdős–Miller theorem in the class of infinite K n -free graphs: we show that for any infinite K n -free graph G = ( V , E ) and m ∈ N there is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::440da52f7f65299886644bacc443b533
https://doi.org/10.1016/j.jctb.2018.11.006
https://doi.org/10.1016/j.jctb.2018.11.006
Autor:
Dániel T. Soukup, Paul Ellis
Publikováno v:
European Journal of Combinatorics. 77:31-48
We show that if $D$ is a tournament of arbitrary size then $D$ has finite strong components after reversing a locally finite sequence of cycles. In turn, we prove that any tournament can be covered by two acyclic sets after reversing a locally finite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7edd527991db346cd995663645cf1c2
https://doi.org/10.1016/j.ejc.2018.10.008
https://doi.org/10.1016/j.ejc.2018.10.008
Autor:
Dániel T. Soukup, Lajos Soukup
Publikováno v:
The Journal of Symbolic Logic. 83:1247-1281
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already, we signif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bcffaf85d04ab63beefdc69bd5fbce2
https://doi.org/10.1017/jsl.2018.8
https://doi.org/10.1017/jsl.2018.8
Autor:
Dániel T. Soukup
Publikováno v:
Journal of Graph Theory. 88:606-630
Motivated by an old conjecture of P. Erd\H{o}s and V. Neumann-Lara, our aim is to investigate digraphs with uncountable dichromatic number and orientations of undirected graphs with uncountable chromatic number. A graph has uncountable chromatic numb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::349abef66b140e486bb14a555022f30f
https://doi.org/10.1002/jgt.22233
https://doi.org/10.1002/jgt.22233
We show that several dichotomy theorems concerning the second level of the Borel hierarchy are special cases of the $\aleph_0$-dimensional generalization of the open graph dichotomy, which itself follows from the usual proof(s) of the perfect set the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b6397df8067b0a6b929d34289c0a88d
http://hdl.handle.net/2318/1793434
http://hdl.handle.net/2318/1793434
Autor:
Dániel T. Soukup, Chris Lambie-Hanson
The optimality of the Erd\H{o}s-Rado theorem for pairs is witnessed by the colouring $\Delta_\kappa : [2^\kappa]^2 \rightarrow \kappa$ recording the least point of disagreement between two functions. This colouring has no monochromatic triangles or,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6855152fcc35b126f1353ce9e6ee736a
Autor:
Dániel T. Soukup, Imre Leader, Saharon Shelah, Paul A. Russell, Péter Komjáth, Zoltán Vidnyánszky
N. Hindman, I. Leader and D. Strauss proved that it is consistent that there is a finite colouring of $\mathbb R$ so that no infinite sumset $X+X=\{x+y:x,y\in X\}$ is monochromatic. Our aim in this paper is to prove a consistency result in the opposi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::752a081eef2bfe30961b4db4b7c11ce0
Publikováno v:
Discrete Mathematics. 344:112153
We study new partition properties of infinite K n -free graphs. First, we investigate the number bpi ( G , m ) introduced by A. Aranda et al. (denoted there by r ( G , m ) ) : the minimal r so that for any partition of G into r classes of equal size,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29ce8ac8c2c7385e462baa9e7681f353
https://doi.org/10.1016/j.disc.2020.112153
https://doi.org/10.1016/j.disc.2020.112153