Author

A. Shapira

h-index 26 View on Semantic Scholar

We have 2 of 124 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

A Tight Erd\H{o}s-Stone Bound for All Graph Densities

The Erd\H{o}s--Stone Theorem asserts that if a graph has edge density $1-1/r+\delta$ then it contains a complete $(r+1)$-partite graph with $b$ vertices in each part, where $b=b_n(r,\delta) \gg 1$. The celebrated Chv\'atal--Szemer\'edi theorem determined the exact order of $b_n(r,\delta)$ for every $\delta<1/r^3$. Thei...

A. Shapira, Raphael Yuster · 0 citations

Jul 2026

Graph k-Coloring in Average Sublinear Time

The main result shows that the exact average-case complexity of this fundamental problem is $\Theta(nk)$ for every $k \leq n^{c'}$ and some $c'\in (0, 1)$, and reveals the average sublinear nature of $k$-colorability: the average-case complexity is linear in $n$, and thus sublinear in the size of the input.

Cassandra Marcussen, Edward Pyne, R. Rubinfeld et al. · arXiv.org · 0 citations