Independent finite sums for \(K_ m\)-free graphs

DOI10.1006/jcta.1996.2760zbMath0871.05045OpenAlexW1993214414MaRDI QIDQ1356037

Neil Hindman, David S. Gundersson, Dona E. Strauss, Walter A. Deuber

Publication date: 14 September 1997

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1996.2760

zbMATH Keywords

Hindman theoremfinite sumsindependent sets in graphscancellative semigroups\(\beta S\) semigroup

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Generalized Ramsey theory (05C55)

Related Items (3)

Independent finite sums in graphs defined on the natural numbers ⋮ Independent Deuber sets in graphs on the natural numbers ⋮ Independent arithmetic progressions in clique-free graphs on the natural numbers

Cites Work

• Ultrafilters and multidimensional Ramsey theorems
• On a metric generalization of Ramsey's theorem
• Independent finite sums in graphs defined on the natural numbers
• Finite sums from sequences within cells of a partition of N
• A short proof of Hindman's theorem
• The Existence of Certain Ultrafilters on N and a Conjecture of Graham and Rothschild
• Unnamed Item
• Unnamed Item

This page was built for publication: Independent finite sums for \(K_ m\)-free graphs