activity
19982026
most citedOn-line secret sharing

15 citations · 53 across the 46 of their papers we have counts for

collaborators

56 papers

math.CO2026

Cutting a convex body into fat parts and approximating Euclidean distance by graph distances

János Pach, Gábor Tardos

Can one construct a graph on the set of integer points in the plane such that the length of the shortest path between any two vertices of differs from their…

math.CO2025

Is the space of reachable particle configurations dense?

Janos Pach, Gabor Tardos

Let be a finite sequence of points in an Euclidean space . Suppose that there is a (pointlike) particle sitting at each point . In a ``legal'' move, any…

math.CO2023

On edge-ordered graphs with linear extremal functions

Gaurav Kucheriya, Gábor Tardos

The systematic study of Turán-type extremal problems for edge-ordered graphs was initiated by Gerbner et al. in 2020. Here we characterize connected edge-ordered graphs with linear…

math.CO2023

On the Extremal Functions of Acyclic Forbidden 0-1 Matrices

Seth Pettie, Gábor Tardos

The extremal theory of forbidden 0-1 matrices studies the asymptotic growth of the function , which is the maximum weight of a matrix wh…

math.CO2022

Where have all the grasshoppers gone?

János Pach, Gábor Tardos

Let be an -element point set in the plane. Consider (pointlike) grasshoppers sitting at different points of . In a "legal" move, any one of them can jump over another…

math.CO2022

Successive vertex orderings of fully regular graphs

Lixing Fang, Hao Huang, Janos Pach +2

A graph G = (V,E) is called fully regular if for every independent set , the number of vertices in I that are not connected to any element of I depends on…