Monochrome symmetric subsets in \(2\)-colorings of groups (Q1408533)
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 1985369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Monochrome symmetric subsets in \(2\)-colorings of groups |
scientific article; zbMATH DE number 1985369 |
Statements
Monochrome symmetric subsets in \(2\)-colorings of groups (English)
0 references
24 September 2003
0 references
Summary: \(A\) subset \(A\) of a group \(G\) is called symmetric with respect to the element \(g \in G\) if \(A=gA^{-1}g\). It is proved that in any \(2\)-coloring, every infinite group \(G\) contains monochrome symmetric subsets of arbitrarily large cardinality less than \(|G|\).
0 references
0.9302380681037904
0 references
0.902056097984314
0 references
0.7826756238937378
0 references
