English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We describe algorithmic Number On the Forehead protocols that provide denseRuzsa-Szemer\'{e}di graphs. One protocol leads to a simple and naturalextension of the original construction of Ruzsa and Szemer\'{e}di. The graphsinduced by this protocol have $n$ vertices, $\Omega(n^2/\log n)$ edges, and aredecomposable into $n^{1+O(1/\log \log n)}$ induced matchings. Another protocolis an explicit (and slightly simpler) version of the construction of Alon,Moitra and Sudakov, producing graphs with similar properties. We alsogeneralize the above protocols to more than three players, in order toconstruct dense uniform hypergraphs in which every edge lies in a positivesmall number of simplices.

Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemer\'{e}di Graphs and Hypergraphs