3 citations · 4 across the 4 of their papers we have counts for
7 papers
Big Ramsey degrees and forbidden cycles
Martin Balko, David Chodounský, Jan Hubička +3
Using the Carlson-Simpson theorem, we give a new general condition for a structure in a finite binary relational language to have finite big Ramsey degrees
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…
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…
Extending partial automorphisms of -partite tournaments
Jan Hubička, Colin Jahel, Matěj Konečný +1
We prove that for every the class of all finite -partite tournaments (orientations of complete -partite graphs) has the extension property for partial automorphisms…
EPPA for two-graphs and antipodal metric spaces
David Evans, Jan Hubička, Matěj Konečný +1
We prove that the class of finite two-graphs has the extension property for partial automorphisms (EPPA, or Hrushovski property), thereby answering a question of Macpherson. In oth…
On the Simultaneous Minimum Spanning Trees Problem
Matěj Konečný, Stanislav Kučera, Jana Novotná +4
Simultaneous Embedding with Fixed Edges (SEFE) is a problem where given planar graphs we ask whether they can be simultaneously embedded so that the embedding of each graph is…