4 citations · 8 across the 6 of their papers we have counts for
10 papers
On ordered Ramsey numbers of tripartite 3-uniform hypergraphs
Martin Balko, Máté Vizer
For an integer , an ordered -uniform hypergraph is a -uniform hypergraph together with a fixed linear ordering of its vertex set. The or…
The constant of point-line incidence constructions
Martin Balko, Adam Sheffer, Ruiwen Tang
We study a lower bound for the constant of the Szemerédi-Trotter theorem. In particular, we show that a recent infinite family of point-line configurations satisfies $I({\mathcal P…
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…
Minimal Representations of Order Types by Geometric Graphs
Oswin Aichholzer, Martin Balko, Michael Hoffmann +8
In order to have a compact visualization of the order type of a given point set S, we are interested in geometric graphs on S with few edges that unambiguously display the order ty…