Independent arithmetic progressions in clique-free graphs on the natural numbers
From MaRDI portal
Publication:5929832
DOI10.1006/jcta.1999.3007zbMath0977.05137OpenAlexW2044637983MaRDI QIDQ5929832
Hans Jürgen Prömel, Vojtěch Rödl, David S. Gundersson, Imre Leader
Publication date: 17 April 2001
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3476ba1a20cb678d7628300dacfd052fb2ee687e
Related Items
Independent Deuber sets in graphs on the natural numbers ⋮ Structure Along Arithmetic Patterns in Sequences of Vectors ⋮ Pseudo-arithmetic sets and Ramsey theory
Cites Work
- Unnamed Item
- Unnamed Item
- Quantitative theorems for regular systems of equations
- Ramsey's theorem with sums or unions
- 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
- Ramsey's Theorem for n-Parameter Sets
- Note on Combinatorial Analysis
- Ein kombinatorischer Satz der Elementargeometrie
This page was built for publication: Independent arithmetic progressions in clique-free graphs on the natural numbers