10 citations · 10 across the 3 of their papers we have counts for
3 papers
math.CO2009
Elementary proof techniques for the maximum number of islands
János Barát, Péter Hajnal, Eszter K. Horváth
Islands are combinatorial objects that can be intuitively defined on a board consisting of a finite number of cells. Based on the neighbor relation of the cells, it is a fundamenta…
math.CO2009
On winning fast in Avoider-Enforcer games
János Barát, Miloš Stojaković
We analyze the duration of the unbiased Avoider-Enforcer game for three basic positional games. All the games are played on the edges of the complete graph on vertices, and Avo…
math.CO2005★ 10 cited
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Janos Barat, Jiri Matousek, David R. Wood
The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separa…