Independent Deuber sets in graphs on the natural numbers
From MaRDI portal
Publication:1406743
DOI10.1016/S0097-3165(03)00100-6zbMath1028.05114OpenAlexW2027965373MaRDI QIDQ1406743
Hans Jürgen Prömel, Vojtěch Rödl, David S. Gundersson, Imre Leader
Publication date: 7 September 2003
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0097-3165(03)00100-6
Other combinatorial number theory (11B75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10) Arithmetic progressions (11B25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantitative theorems for regular systems of equations
- Independent finite sums for \(K_ m\)-free graphs
- On a metric generalization of Ramsey's theorem
- Independent finite sums in graphs defined on the natural numbers
- Studien zur Kombinatorik
- Partitionen und lineare Gleichungssysteme
- Regularity and Positional Games
- On sets of integers containing k elements in arithmetic progression
- Independent arithmetic progressions in clique-free graphs on the natural numbers