Elsevier

Discrete Mathematics

Volume 61, Issues 2–3, September 1986, Pages 321-324
Discrete Mathematics

Communication
An extremal coloring problem on matrices

https://doi.org/10.1016/0012-365X(86)90104-4Get rights and content
Under an Elsevier user license
open archive

Abstract

Given an n × κ-matrix. How many colors c(n, k) are needed the entries such that no four monochromatic entries exist being the vertices of a rectangle? Bounds and the asymptotic of c(n, k) are given.

Cited by (0)