30 citations · 90 across the 27 of their papers we have counts for
5 papers · 1 filter
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…
Bounding and computing obstacle numbers of graphs
Martin Balko, Steven Chaplick, Robert Ganian +4
An obstacle representation of a graph consists of a set of pairwise disjoint simply-connected closed regions and a one-to-one mapping of the vertices of to points such that…
Erdős--Szekeres-type problems in the real projective plane
Martin Balko, Manfred Scheucher, Pavel Valtr
We consider point sets in the real projective plane and explore variants of classical extremal problems about planar point sets in this setting, with a main focus o…
On off-diagonal ordered Ramsey numbers of nested matchings
Martin Balko, Marian Poljak
For two graphs and with linearly ordered vertex sets, the ordered Ramsey number is the minimum such that every red-blue coloring of the edges of the…