Independent Deuber sets in graphs on the natural numbers
DOI10.1016/S0097-3165(03)00100-6zbMATH Open1028.05114OpenAlexW2027965373MaRDI QIDQ1406743FDOQ1406743
David S. Gunderson, Hans Jürgen Prömel, Imre Leader, Vojtěch Rödl
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Other combinatorial number theory (11B75) Ramsey theory (05D10) Arithmetic progressions (11B25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regularity and Positional Games
- On sets of integers containing k elements in arithmetic progression
- Quantitative theorems for regular systems of equations
- Studien zur Kombinatorik
- On a metric generalization of Ramsey's theorem
- Partitionen und lineare Gleichungssysteme
- Independent finite sums for \(K_ m\)-free graphs
- Independent finite sums in graphs defined on the natural numbers
- Independent arithmetic progressions in clique-free graphs on the natural numbers
Cited In (3)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Some remarks on the theory of graphs 👍 👎
- Rado Partition Theorem for Random Subsets of Integers 👍 👎
- Two remarks on Ramsey's theorem 👍 👎
- Graphs on affine and linear spaces and Deuber sets 👍 👎
- Image partition regularity near zero 👍 👎
- Open Problems in Partition Regularity 👍 👎
- Independent arithmetic progressions in clique-free graphs on the natural numbers 👍 👎
This page was built for publication: Independent Deuber sets in graphs on the natural numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406743)
