On the coloring of 3-element subsets
Combinatorics
2017-01-11 v2
Abstract
In this paper we prove that for numbers , such that is prime, there exists the coloring of all 3-element subsets of {1, ..., n} such that any sets have different colors.
Keywords
Cite
@article{arxiv.1611.03809,
title = {On the coloring of 3-element subsets},
author = {D. Zakharov},
journal= {arXiv preprint arXiv:1611.03809},
year = {2017}
}
Comments
4 pages