29 citations · 74 across the 56 of their papers we have counts for
68 papers · 1 filter
Saturation and semisaturation of oriented graphs
Vladimir Bošković, Balázs Keszegh
We consider a natural extension of the classical saturation problem to oriented graphs, defined as the minimum number of edges in an oriented graph on vertices that avoids…
Forbidden stars in multidimensional - matrices and visibility of lattice points
Zoltán Füredi, Balázs Keszegh, Paul Manuel
A -dimensional - matrix of size can be considered as a Boolean function $M: B(n_1\times n_2\times \dots \times n_d) \to \{ 0,1\}…
Piercing all maximum cliques in hypergraphs
Andreas Holmsen, Attila Jung, Balázs Keszegh +2
Graphs whose maximum clique size exceeds half of the total number of vertices satisfy a classical property: the family of their maximum sized cliques can be pierced by a single ver…
On the maximum number of tangencies among -intersecting curves
Eyal Ackerman, Balázs Keszegh
According to a conjecture of Pach, there are tangent pairs among any family of Jordan arcs in which every pair of arcs has precisely one common point and no three arcs s…
On Triangles in Colored Pseudoline Arrangements
Yan Alves Radtke, Balázs Keszegh, Robert Lauff
We consider the faces in pseudoline arrangements in which the pseudolines are colored with two colors. Björner, Las Vergnas, Sturmfels, White, and Ziegler conjecture the existence…
Coloring Geometric Hypergraphs: A Survey
Gábor Damásdi, Balázs Keszegh, János Pach +2
The \emph{chromatic number} of a hypergraph is the smallest number of colors needed to color the vertices such that no edge of at least two vertices is monochromatic. Given a famil…