23 citations · 54 across the 45 of their papers we have counts for
5 papers · 1 filter
A New Bound for the Brown--Erdős--Sós Problem
David Conlon, Lior Gishboliner, Yevgeny Levanzov +1
Let denote the maximum number of edges in a -uniform hypergraph not containing edges spanned by at most vertices. One of the most influential open problems in…
A Ramsey variant of the Brown-Erdős-Sós conjecture
Asaf Shapira, Mykhaylo Tyomkyn
An -uniform hypergraph (-graph for short) is called linear if every pair of vertices belong to at most one edge. A linear -graph is complete if every pair of vertices are…
A Tight Bound for Hyperaph Regularity
Guy Moshkovitz, Asaf Shapira
The hypergraph regularity lemma -- the extension of Szemerédi's graph regularity lemma to the setting of -uniform hypergraphs -- is one of the most celebrated combinatorial resu…
Testing Graphs against an Unknown Distribution
Lior Gishboliner, Asaf Shapira
The area of graph property testing seeks to understand the relation between the global properties of a graph and its local statistics. In the classical model, the local statistics…
A quantitative Lovász criterion for Property B
Asaf Ferber, Asaf Shapira
A well known observation of Lovász is that if a hypergraph is not -colorable, then at least one pair of its edges intersect at a single vertex. %This very simple criterion turne…