activity
20132025
most citedMathias forcing and combinatorial covering properties of filters

32 citations · 64 across the 10 of their papers we have counts for

collaborators

11 papers

math.LO2025

Shelah Ultrafilters

Emmanuel Balderas, David Chodounský, Osvaldo Guzmán

In this paper, we study a special type of ultrafilter which we call Shelah ultrafilter. We show that it is possible to add a Shelah ultrafilter using a special forcing notion. We a…

math.CO2023★ 2 cited

Ramsey theorem for trees with successor operation

Martin Balko, David Chodounský, Natasha Dobrinen +4

We prove a general Ramsey theorem for trees with a successor operation. This theorem is a common generalization of the Carlson-Simpson Theorem and the Milliken Tree Theorem for reg…

math.CO2023

Type-respecting amalgamation and big Ramsey degrees

Andrés Aranda, Samuel Braunfeld, David Chodounský +4

We give an infinitary extension of the Nešetřil-Rödl theorem for category of relational structures with special type-respecting embeddings.

math.CO2021

Big Ramsey degrees of the generic partial order

Martin Balko, David Chodounský, Natasha Dobrinen +4

As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order in a similar way as Devlin characterised big Ramsey degrees of the ge…

math.CO2020

Big Ramsey degrees of 3-uniform hypergraphs are finite

Martin Balko, David Chodounský, Jan Hubička +2

We prove that the universal homogeneous 3-uniform hypergraph has finite big Ramsey degrees. This is the first case where big Ramsey degrees are known to be finite for structures in…

math.LO2019

Splitting chains, tunnels and twisted sums

Félix Cabello Sánchez, Antonio Avilés, Piotr Borodulin-Nadzieja +2

We study splitting chains in , that is, families of subsets of which are linearly ordered by and which are splitting. We prove that their existenc…

math.CO2019★ 3 cited

Big Ramsey degrees of 3-uniform hypergraphs

Martin Balko, David Chodounský, Jan Hubička +2

Given a countably infinite hypergraph and a finite hypergraph , the big Ramsey degree of in is the least number such that, fo…

math.LO2015★ 13 cited

Mathias--Prikry and Laver type forcing; Summable ideals, coideals, and -selective filters

David Chodounský, Osvaldo Guzmán, Michael Hrušák

We study the Mathias--Prikry and the Laver type forcings associated with filters and coideals. We isolate a crucial combinatorial property of Mathias reals, and prove that Mathias-…

math.LO2014★ 8 cited

Why Y-c.c

David Chodounský, Jindřich Zapletal

We outline a portfolio of novel iterable properties of c.c.c. and proper forcing notions and study its most important instantiations, Y-c.c. and Y-properness. These properties have…

math.LO2014★ 32 cited

Mathias forcing and combinatorial covering properties of filters

David Chodounský, Dušan Repovš, Lyubomyr Zdomskyy

We give topological characterizations of filters on such that the Mathias forcing adds no dominating reals or preserves ground model unbounded families. This allows u…

math.GN2013★ 6 cited

The Katowice problem and autohomeomorphisms of

David Chodounsky, Alan Dow, Klaas Pieter Hart +1

We show that the existence of a homeomorphism between and entails the existence of a non-trivial autohomeomorphism of .