30 citations · 90 across the 27 of their papers we have counts for
5 papers · 1 filter
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…
Hypergraph based Berge hypergraphs
Martin Balko, Daniel Gerbner, Dong Yeap Kang +2
Fix a hypergraph . A hypergraph is called a {\it Berge copy of } or {\it Berge-} if we can choose a subset of each hyperedge of…
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…
Edge-ordered Ramsey numbers
Martin Balko, Máté Vizer
We introduce and study a variant of Ramsey numbers for edge-ordered graphs, that is, graphs with linearly ordered sets of edges. The edge-ordered Ramsey number $\overline{R}_e(\mat…
Ramsey numbers and monotone colorings
Martin Balko
For positive integers and , an -monotone coloring of is a 2-coloring by and that is monotone on the lexicographically ordered…