Transversals of latin squares and their generalizations
From MaRDI portal
Publication:1215505
DOI10.2140/pjm.1975.59.567zbMath0302.05015OpenAlexW2082184422MaRDI QIDQ1215505
Publication date: 1975
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1975.59.567
Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (79)
The number of distinct symbols in sections of rectangular arrays ⋮ Transversals, near transversals, and diagonals in iterated groups and quasigroups ⋮ Transversals and multicolored matchings ⋮ Full rainbow matchings in graphs and hypergraphs ⋮ An improved bound on the sizes of matchings guaranteeing a rainbow matching ⋮ Research problem 40 ⋮ On the chromatic number of Latin square graphs ⋮ Rainbow Matchings in Properly Colored Multigraphs ⋮ Covering with Latin transversals ⋮ Large matchings in bipartite graphs have a rainbow matching ⋮ Decomposition of bi-colored square arrays into balanced diagonals ⋮ Coloured matchings in bipartite graphs ⋮ An approximate version of a conjecture of Aharoni and Berger ⋮ Posterior propriety and admissibiity of hyperpriors in normal hierarchical models ⋮ Transversals in long rectangular arrays ⋮ New bounds for Ryser’s conjecture and related problems ⋮ On sets not belonging to algebras and rainbow matchings in graphs ⋮ Maximum transversal in partial Latin squares and rainbow matchings ⋮ Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv ⋮ On a Generalization of the Ryser-Brualdi-Stein Conjecture ⋮ Almost color-balanced perfect matchings in color-balanced complete graphs ⋮ Topological methods for the existence of a rainbow matching ⋮ Almost all optimally coloured complete graphs contain a rainbow Hamilton path ⋮ Delay colourings of cubic graphs ⋮ Representation of Large Matchings in Bipartite Graphs ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ On a conjecture of Stein ⋮ Long directed rainbow cycles and rainbow spanning trees ⋮ Hamilton transversals in random Latin squares ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Choice functions ⋮ Decomposition of Bicolored Square Arrays into Bichromatic Diagonals ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Almost fair perfect matchings in complete bipartite graphs ⋮ Degree Conditions for Matchability in 3‐Partite Hypergraphs ⋮ Fair Representation by Independent Sets ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Balanced equi-\(n\)-squares ⋮ New bounds for the Moser‐Tardos distribution ⋮ Orthogonal Latin Rectangles ⋮ Covariance estimation: the GLM and regularization perspectives ⋮ Minimax estimation for mixtures of Wishart distributions ⋮ A counterexample to Stein’s Equi-$n$-square Conjecture ⋮ Rainbow structures in locally bounded colorings of graphs ⋮ A Rainbow Dirac's Theorem ⋮ Embedding rainbow trees with applications to graph labelling and decomposition ⋮ The chromatic number of finite group Cayley tables ⋮ Large rainbow matchings in semi-strong edge-colorings of graphs ⋮ A system of disjoint representatives of line segments with given \(k\) directions ⋮ Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting ⋮ Rainbow Matchings: existence and counting ⋮ Rainbow matchings and rainbow connectedness ⋮ On rainbow matchings in bipartite graphs ⋮ Maximum weight edge-constrained matchings ⋮ Rainbow matchings in bipartite multigraphs ⋮ Existence of rainbow matchings in properly edge-colored graphs ⋮ The interplay of Bayesian and frequentist analysis ⋮ Algorithms and complexity for a class of combinatorial optimization problems with labelling ⋮ On acyclic edge-coloring of complete bipartite graphs ⋮ Flexible covariance estimation in graphical Gaussian models ⋮ The odd case of Rota's bases conjecture ⋮ Nonlinear shrinkage estimation of large-dimensional covariance matrices ⋮ Perfect matchings in \(r\)-partite \(r\)-graphs ⋮ Rainbow factors in hypergraphs ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Lopsided Lovász Local lemma and Latin transversals ⋮ Transversals in generalized Latin squares ⋮ Positiveness of the permanent of 4-dimensional polystochastic matrices of order 4 ⋮ A matroid generalization of a result on row-Latin rectangles ⋮ Transversals in row-latin rectangles ⋮ Rainbow paths and large rainbow matchings ⋮ On the number of symbols that forces a transversal ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ Rainbow matchings of size \(m\) in graphs with total color degree at least \(2mn\) ⋮ Rainbow matchings in strongly edge-colored graphs ⋮ A NOTE ON RAINBOW MATCHINGS ⋮ Rainbow sets in the intersection of two matroids
This page was built for publication: Transversals of latin squares and their generalizations
