30 citations · 90 across the 27 of their papers we have counts for
5 papers · 1 filter
Tight bounds on the expected number of holes in random point sets
Martin Balko, Manfred Scheucher, Pavel Valtr
For integers and , a -hole in a set of points in general position in is a -tuple of points from in convex position such that the…
Exact big Ramsey degrees for finitely constrained binary free amalgamation classes
Martin Balko, David Chodounský, Natasha Dobrinen +4
We characterize the big Ramsey degrees of free amalgamation classes in finite binary languages defined by finitely many forbidden irreducible substructures, thus refining the recen…
Implementation of Sprouts: a graph drawing game
Tomáš Čížek, Martin Balko
Sprouts is a two-player pencil-and-paper game invented by John Conway and Michael Paterson in 1967. In the game, the players take turns in joining dots by curves according to simpl…
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…