9 citations · 9 across the 8 of their papers we have counts for
9 papers · 1 filter
Set mappings for general graphs
Lior Gishboliner, Zhihan Jin, Benny Sudakov
The study of extremal problems for set mappings has a long history. It was introduced in 1958 by Erdős and Hajnal, who considered the case of cliques in graphs and hypergraphs. Rec…
Sunflowers and Ramsey problems for restricted intersections
Barnabás Janzer, Zhihan Jin, Benny Sudakov +1
Extremal problems on set systems with restricted intersections have been an important part of combinatorics in the last 70 years. In this paper, we study the following Ramsey versi…
The Helly number of Hamming balls and related problems
Noga Alon, Zhihan Jin, Benny Sudakov
We prove the following variant of Helly's classical theorem for Hamming balls with a bounded radius. For and any (finite or infinite) set , if in a family of Hamming balls…
Difference-Isomorphic Graph Families
Lior Gishboliner, Zhihan Jin, Benny Sudakov
Many well-studied problems in extremal combinatorics deal with the maximum possible size of a family of objects in which every pair of objects satisfies a given restriction. One pr…
Extremal, enumerative and probabilistic results on ordered hypergraph matchings
Michael Anastos, Zhihan Jin, Matthew Kwan +1
An ordered -matching is an -uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of -dimensional o…
Ramsey problems for monotone paths in graphs and hypergraphs
Lior Gishboliner, Zhihan Jin, Benny Sudakov
The study of ordered Ramsey numbers of monotone paths for graphs and hypergraphs has a long history, going back to the celebrated work by Erdős and Szekeres in the early days of Ra…
Exponential Erdős-Szekeres theorem for matrices
Recep Altar Çiçeksiz, Zhihan Jin, Eero Räty +1
In 1993, Fishburn and Graham established the following qualitative extension of the classical Erdős-Szekeres theorem. If is sufficiently large with respect to , then any $N\…
The Minimum Degree Removal Lemma Thresholds
Lior Gishboliner, Zhihan Jin, Benny Sudakov
The graph removal lemma is a fundamental result in extremal graph theory which says that for every fixed graph and , if an -vertex graph contains $\vare…
Ramsey numbers of semi-algebraic and semi-linear hypergraphs
Zhihan Jin, István Tomon
An -uniform hypergraph is semi-algebraic of complexity if the vertices of correspond to points in , and the edges of are determi…