#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2000

2005

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Andrzej Nowik, Tomasz Weiss
- J. Symb. Log.
- 2002

We prove the following theorems: (1) Suppose that f : 2ω → 2ω is a continuous function and X is a Sierpiński set. Then (A) for any strongly measure zero set Y , the image f [X + Y ] is an s0-set, (B) f [X] is a perfectly meager set in the transitive sense. (2) Every strongly meager set is completely Ramsey null. This paper is a continuation of earlier works… (More)

- Tomasz Dzido, Andrzej Nowik, Piotr Szuca
- Electr. J. Comb.
- 2005

For given finite family of graphs G1, G2, . . . , Gk, k ≥ 2, the multicolor Ramsey number R(G1, G2, . . . , Gk) is the smallest integer n such that if we arbitrarily color the edges of the complete graph on n vertices with k colors then there is always a monochromatic copy of Gi colored with i, for some 1 ≤ i ≤ k. We give a lower bound for k−color Ramsey… (More)

A function f :R → {0, 1} is weakly symmetric (weakly symmetrically continuous) at x ∈ R provided there is a sequence hn → 0 such AMS classification numbers: Primary 26A15; Secondary 03E50, 03E35.

- ‹
- 1
- ›