activity
20092026
most citedInduced and non-induced poset saturation problems

29 citations · 74 across the 56 of their papers we have counts for

collaborators

73 papers

math.CO2026

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\}…

math.CO2026

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…

math.CO2026

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…

math.CO2026

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…

math.CO2025

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…

math.CO2025

Unavoidable patterns and plane paths in dense topological graphs

Balázs Keszegh, Andrew Suk, Gábor Tardos +1

Let be the complete bipartite geometric graph, with and vertices on two distinct parallel lines respectively, and all straight-line edges drawn between them…