A canonical partition theorem for equivalence relations on Z^ n.
From MaRDI portal
Publication:1050982
DOI10.1016/0097-3165(83)90067-5zbMATH Open0514.05002OpenAlexW2098665349MaRDI QIDQ1050982FDOQ1050982
Authors: Walter A. Deuber, Ron Graham, Hans Jürgen Prömel, Bernd Voigt
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(83)90067-5
Cites Work
- Title not available (Why is that?)
- On sets of integers containing k elements in arithmetic progression
- An ergodic Szemerédi theorem for commuting transformations
- A Combinatorial Theorem
- Studien zur Kombinatorik
- Ein kombinatorischer Satz der Elementargeometrie
- Partition theorems for parameter systems and graphs
Cited In (7)
- Canonical configurations
- On quantitative aspects of a canonisation theorem for edge‐orderings
- Reverse mathematics, computability, and partitions of trees
- An elementary proof of the canonizing version of Gallai-Witt's theorem
- Quantitative theorems for regular systems of equations
- Canonizing partition theorems: Diversification, products, and iterated versions
- A canonical restricted version of van der Waerden's theorem
This page was built for publication: A canonical partition theorem for equivalence relations on \(Z^ n\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1050982)