Pages that link to "Item:Q424579"
From MaRDI portal
The following pages link to A simple proof and some difficult examples for Hindman's theorem (Q424579):
Displaying 7 items.
- Transfinite approximation of Hindman's theorem (Q1760370) (← links)
- A combinatorial proof of the dense Hindman's theorem (Q2275370) (← links)
- Hindman's theorem is only a countable phenomenon (Q2413413) (← links)
- Hindman's coloring theorem in arbitrary semigroups (Q2443249) (← links)
- Effectiveness of Hindman’s Theorem for Bounded Sums (Q2970955) (← links)
- ON THE STRENGTH OF TWO RECURRENCE THEOREMS (Q2976336) (← links)
- (Q3370069) (← links)