Article contents
An ordinal partition avoiding pentagrams
Published online by Cambridge University Press: 12 March 2014
Abstract
Suppose that α = γ + δ where γ ≥ δ > 0. Then there is a graph which has no independent set of order type and has no pentagram (a pentagram is a set of five points with all pairs joined by edges). In the notation of Erdős and Rado. who generalized Ramsey's Theorem to this setting.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2000
References
REFERENCES
- 3
- Cited by