On a theorem of {G}alvin and {N}agy (Q1677593)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6806132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a theorem of {G}alvin and {N}agy |
scientific article; zbMATH DE number 6806132 |
Statements
On a theorem of {G}alvin and {N}agy (English)
0 references
10 November 2017
0 references
The author gives the proof of a problem of P. Erdős and A. Hajnal concerning the existence of winning strategies in a combinatorial game of a transfinite length. Such a proof was announced earlier by F. Galvin and Z. Nagy but never published.
0 references
combinatorial game
0 references
arithmetic progression
0 references
uncountable vector space
0 references
0 references
0.8841227
0 references
0 references
0 references
