Decomposition of bi-colored square arrays into balanced diagonals

DOI10.1016/J.ENDM.2015.06.004zbMATH Open1346.05023arXiv1508.03751OpenAlexW2963733148MaRDI QIDQ322180FDOQ322180

Authors: Dani Kotlar, Ran Ziv 

Publication date: 14 October 2016

Abstract: Given an $nimesn$ array $M$ ($nge7$), where each cell is colored in one of two colors, we give a necessary and sufficient condition for the existence of a partition of $M$ into $n$ diagonals, each containing at least one cell of each color. As a consequence, it follows that if each color appears in at least $2n-1$ cells, then such a partition exists. The proof uses results on completion of partial Latin squares.

Full work available at URL: https://arxiv.org/abs/1508.03751

Recommendations

• Decomposition of bicolored square arrays into bichromatic diagonals
• scientific article; zbMATH DE number 812086
• scientific article; zbMATH DE number 7535772
• Balanced diagonals in frequency squares
• On completing partial Latin squares with prescribed diagonals

zbMATH Keywords

partial Latin squarebalanced diagonal

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Transversals of latin squares and their generalizations
• Combinatorial matrix theory
• Asymptotic behavior of the chromatic index for hypergraphs
• Thank Evans!
• Title not available (Why is that?)
• Covering with Latin transversals
• Orthogonal Latin Rectangles
• A Combinatorial Theorem with an Application to Latin Rectangles
• Research problems
• On the degree, size, and chromatic index of a uniform hypergraph

Cited In (4)

• Decomposition of bicolored square arrays into bichromatic diagonals
• Title not available (Why is that?)
• Balanced diagonals in frequency squares
• Balanced equi-\(n\)-squares

This page was built for publication: Decomposition of bi-colored square arrays into balanced diagonals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322180)