Explicit Expanders of Every Degree and Size von Alon, Noga

Volltext

Connectivity graph‐codes von Alon, Noga

Volltext

Spanning trees with few non-leaves von Alon, Noga

Volltext

Asymptotically optimal induced universal graphs von Alon, Noga

Volltext

List-Decodable Zero-Rate Codes von Alon, Noga, Bukh, Boris, Polyanskiy, Yury

Volltext

Uniformly Discrete Forests with Poor Visibility von ALON, NOGA

Volltext

Near-sunflowers and focal families von Alon, Noga, Holzman, Ron

Volltext

Divisible subdivisions von Alon, Noga, Krivelevich, Michael

Volltext

Logarithmically larger deletion codes of all distances von Alon, Noga, Bourla, Gabriela, Graham, Ben, He, Xiaoyu, Kravitz, Noah

Volltext

Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles von Alon, Noga, Pokrovskiy, Alexey, Sudakov, Benny

Volltext

Irregular subgraphs von Alon, Noga, Wei, Fan

Volltext

Additive Approximation of Generalized Turán Questions von Alon, Noga, Shikhelman, Clara

Volltext

Complete minors and average degree: A short proof von Alon, Noga, Krivelevich, Michael, Sudakov, Benny

Volltext

Biomolecular network motif counting and discovery by color coding von Alon, Noga, Dao, Phuong, Hajirasouliha, Iman, Hormozdiari, Fereydoun, Sahinalp, S. Cenk

Volltext

Testing Equality in Communication Graphs von Alon, Noga, Efremenko, Klim, Sudakov, Benny

Volltext

The diameter of the uniform spanning tree of dense graphs von Alon, Noga, Nachmias, Asaf, Shalev, Matan

Volltext

Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits von Alon, Noga, Kumar, Mrinal, Volk, Ben Lee

Volltext

Clique coloring of dense random graphs von Alon, Noga, Krivelevich, Michael

Volltext

Optimal induced universal graphs for bounded-degree graphs von ALON, NOGA, NENADOV, RAJKO

Volltext

High-girth near-Ramanujan graphs with localized eigenvectors von Alon, Noga, Ganguly, Shirshendu, Srivastava, Nikhil

Volltext