A
Asaf Shapira
Researcher at Tel Aviv University
Publications - 167
Citations - 3633
Asaf Shapira is an academic researcher from Tel Aviv University. The author has contributed to research in topics: Graph property & Complement graph. The author has an hindex of 29, co-authored 159 publications receiving 3384 citations. Previous affiliations of Asaf Shapira include Microsoft & Georgia Institute of Technology.
Papers
More filters
Posted Content
A Short Proof of Gowers' Lower Bound for the Regularity Lemma
Guy Moshkovitz,Asaf Shapira +1 more
TL;DR: In this article, the authors give a new proof of Gowers' regularity lemma, which uses a construction and proof of correctness that are significantly simpler and shorter than those presented in this paper.
Journal ArticleDOI
Tournament Quasirandomness from Local Counting
TL;DR: In this paper, the authors investigated the relationship between quasirandomness of T and the count of a single h-vertex tournament H in T. They showed that a constant proportion of all tournaments are not locally forcing.
Testing Linear Inequalities of Subgraph Statistics.
TL;DR: In this paper, it was shown that some properties of induced subgraphs are not testable even in the classical (i.e., unrestricted) model of graph property testing.
Posted Content
Forcing $k$-repetitions in degree sequences
TL;DR: In this paper, it was shown that for any positive integer k, there is a constant k = C(k) where k is the number of vertices of the same degree in a graph.
Posted Content
A New Bound for the Brown--Erd\H{o}s--S\'os Problem.
TL;DR: The state-of-the-art result of Solymosi et al. as discussed by the authors was obtained by improving the S\'{a}rk\"{o}zy--Selkow bound from 5 to 4.