OurBigBook
About
$
Donate
Sign in
Sign up
Finite coloring
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Combinatorics
Ramsey theory
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
A
finite coloring
of
a
set
X
is
a
function
c
:
X
→
C
into
a
finite set
C
of
colors
.
A
subset
is monochromatic when the restriction of
c
to it is
constant
.
Table of contents
Monochromatic set
Finite coloring
Monochromatic set
0
0
0
Finite coloring
Ancestors
(5)
Ramsey theory
Combinatorics
Area of mathematics
Mathematics
Home
Incoming links
(8)
Gallai theorem for an integer lattice
Hindman theorem
Monochromatic sums-and-products obstruction
Partition regular matrix
Past exam of the mathematics course of the University of Cambridge
/
2025
/
iii
/
Paper 130
/
1
/
a
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2025
/
iii
/
Paper 130
/
1
/
c
/
i
/
Solution
Ramsey theory
Van der Waerden theorem
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version