scientific article

DOI10.4086/toc.2005.v001a009zbMath1213.68422OpenAlexW2405367548MaRDI QIDQ3002762

Asaf Shapira, Noga Alon

Publication date: 24 May 2011

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2005.v001a009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hypergraphsextremal problemslower boundslinear algebraadditive number theoryproperty testing

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Related Items

Polynomial removal lemmas for ordered graphs ⋮ On 3‐graphs with no four vertices spanning exactly two edges ⋮ Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses