scientific article; zbMATH DE number 3613053

zbMath0395.05012MaRDI QIDQ4177580

R. M. A. Wieringa, A. J. de Vries, Andries E. Brouwer

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Lower BoundLength of Partial Transversals in Latin Squares

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

An improved bound on the sizes of matchings guaranteeing a rainbow matching, Large matchings in bipartite graphs have a rainbow matching, New bounds for Ryser’s conjecture and related problems, Topological methods for the existence of a rainbow matching, Almost all optimally coloured complete graphs contain a rainbow Hamilton path, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Longest partial transversals in plexes, Hamilton transversals in random Latin squares, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Embedding rainbow trees with applications to graph labelling and decomposition, Rainbow matchings and cycle-free partial transversals of Latin squares, Rainbow matchings and rainbow connectedness, On rainbow matchings in bipartite graphs, Rainbow perfect matchings in \(r\)-partite graph structures, A lower bound for the length of a partial transversal in a Latin square, Rainbow matchings in bipartite multigraphs, A lower bound for the length of a partial transversal in a Latin square, Orthogonal matchings, A matroid generalization of a result on row-Latin rectangles, Combinatorial analysis. (Matrix problems, choice theory), Rainbow sets in the intersection of two matroids