Plünnecke's Inequality

DOI10.1017/S096354831100037XzbMath1259.05081arXiv1101.2532OpenAlexW2127629487MaRDI QIDQ3103636

Giorgis Petridis

Publication date: 8 December 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.2532

zbMATH Keywords

lower boundssharpnessdirected layered graphmagnification ratios

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items

From Affine to Two-Source Extractors via Approximate Duality ⋮ Plünnecke inequalities for measure graphs with applications ⋮ On Furstenberg's intersection conjecture, self-similar measures, and the \(L^q\) norms of convolutions ⋮ The structure theory of set addition revisited ⋮ On sets with small additive doubling in product sets

Cites Work

• Unnamed Item
• On a theorem of Plünnecke concerning the sum of a basis and a set of positive density
• On Representatives of Subsets
• Eine zahlentheoretische Anwendung der Graphentheorie.