Discrete MathematicsVolume 61, Issues 2–3, September 1986, Pages 321-324CommunicationAn extremal coloring problem on matricesAuthor links open overlay panelHans-Dietrich O.F Gronau, Roger LabahnShow moreShareCitehttps://doi.org/10.1016/0012-365X(86)90104-4Get rights and contentUnder an Elsevier user licenseopen archiveAbstractGiven 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.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1986 Published by Elsevier B.V.