{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:13:05Z","timestamp":1772518385232,"version":"3.50.1"},"reference-count":10,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2011,10,5]],"date-time":"2011-10-05T00:00:00Z","timestamp":1317772800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2011,11]]},"abstract":"<jats:p>Pl\u00fcnnecke's inequality is a standard tool for obtaining estimates on the cardinality of sumsets and has many applications in additive combinatorics. We present a new proof. The main novelty is that the proof is completed with no reference to Menger's theorem or Cartesian products of graphs. We also investigate the sharpness of the inequality and show that it can be sharp for arbitrarily long, but not for infinite commutative graphs. A key step in our investigation is the construction of arbitrarily long regular commutative graphs. Lastly we prove a necessary condition for the inequality to be attained.<\/jats:p>","DOI":"10.1017\/s096354831100037x","type":"journal-article","created":{"date-parts":[[2011,10,5]],"date-time":"2011-10-05T09:03:58Z","timestamp":1317805438000},"page":"921-938","source":"Crossref","is-referenced-by-count":10,"title":["Pl\u00fcnnecke's Inequality"],"prefix":"10.1017","volume":"20","author":[{"given":"GIORGIS","family":"PETRIDIS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2011,10,5]]},"reference":[{"key":"S096354831100037X_ref7","first-page":"93","article-title":"Addendum to: An application of graph theory to additive number theory","volume":"4","author":"Ruzsa","year":"1990","journal-title":"Scientia Ser. A"},{"key":"S096354831100037X_ref6","first-page":"97","article-title":"An application of graph theory to additive number theory","volume":"3","author":"Ruzsa","year":"1989","journal-title":"Scientia Ser. A"},{"key":"S096354831100037X_ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755149"},{"key":"S096354831100037X_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3845-2"},{"key":"S096354831100037X_ref3","doi-asserted-by":"publisher","DOI":"10.4064\/fm-10-1-96-115"},{"key":"S096354831100037X_ref5","first-page":"171","article-title":"Eine zahlentheoretische Anwendung der Graphtheorie","volume":"243","author":"Pl\u00fcnnecke","year":"1970","journal-title":"J. Reine Angew. Math."},{"key":"S096354831100037X_ref1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"S096354831100037X_ref8","volume-title":"Combinatorial Number Theory and Additive Group Theory","author":"Ruzsa","year":"2009"},{"key":"S096354831100037X_ref2","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1995.1098"},{"key":"S096354831100037X_ref9","unstructured":"[9] Tao T. Additive combinatorics. Lecture notes 1, available online at www.math.ucla.edu\/~tao\/254a.1.03w."}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S096354831100037X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T03:40:58Z","timestamp":1556336458000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S096354831100037X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,5]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["S096354831100037X"],"URL":"https:\/\/doi.org\/10.1017\/s096354831100037x","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,5]]}}}