A Combinatorial Theorem with an Application to Latin Rectangles
From MaRDI portal
Publication:5805003
DOI10.2307/2032005zbMath0043.01202OpenAlexW4238415462MaRDI QIDQ5805003
Publication date: 1951
Full work available at URL: https://doi.org/10.2307/2032005
Related Items
Incidence properties of cosets in loops ⋮ Embedding connected factorizations ⋮ Unnamed Item ⋮ Decomposition of bi-colored square arrays into balanced diagonals ⋮ On avoiding odd partial Latin squares and \(r\)-multi Latin squares ⋮ Complete arcs in Steiner triple systems ⋮ A result on generalized Latin rectangles ⋮ On completing partial Latin squares with prescribed diagonals ⋮ Time-tables, polyhedra and the greedy algorithm ⋮ Amalgamated Factorizations of Complete Graphs ⋮ Covers and partial transversals of Latin squares ⋮ Ryser's theorem for \(\rho\)-Latin rectangles ⋮ Embedding an incomplete diagonal latin square in a complete diagonal latin square ⋮ Unnamed Item ⋮ Constrained completion of partial Latin squares ⋮ Embedding incomplete Latin squares in Latin squares whose diagonal is almost completely prescribed ⋮ Decomposition of Bicolored Square Arrays into Bichromatic Diagonals ⋮ The orthogonality spectrum for Latin squares of different orders ⋮ Related necessary conditions for completing partial latin squares ⋮ Row‐Hamiltonian Latin squares and Falconer varieties ⋮ Non-extendible Latin parallelepipeds ⋮ Hamiltonian double Latin squares ⋮ Unnamed Item ⋮ Completion and deficiency problems ⋮ Unnamed Item ⋮ Triple arrays and related designs ⋮ Generalized latin rectangles. II: Embedding ⋮ On the intricacy of avoiding multiple-entry arrays ⋮ Matrices of zeros and ones ⋮ The embedding of partial triple systems when 4 divides \(\lambda\) ⋮ Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs ⋮ Hall's theorem and extending partial Latinized rectangles ⋮ Unnamed Item ⋮ Latin squares with maximal partial transversals of many lengths ⋮ Outline symmetric Latin squares ⋮ On a generalization of the Evans Conjecture ⋮ Some results concerning the complexity of restricted colorings of graphs ⋮ The constant objective value property for multidimensional assignment problems ⋮ Recent results on the total chromatic number ⋮ Embedding Factorizations for 3-Uniform Hypergraphs ⋮ On the completability of incomplete Latin squares ⋮ On embedding incomplete symmetric Latin squares ⋮ A number-theoretic function related to Latin squares ⋮ Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice ⋮ On completing latin squares ⋮ Some combinatorial properties of centrosymmetric matrices ⋮ On the completion of partial squares ⋮ Completing partial Latin squares with blocks of non-empty cells ⋮ Systems of representatives ⋮ Unnamed Item ⋮ Cropper's question and Cruse's theorem about partial Latin squares ⋮ Restricted completion of sparse partial Latin squares ⋮ On Latin squares and the facial structure of related polytopes ⋮ Embedding partial idempotent Latin squares ⋮ Unnamed Item ⋮ A generalisation of \(t\)-designs ⋮ Two classes of \(q\)-ary codes based on group divisible association schemes ⋮ On the finite completion of partial latin cubes ⋮ Completing some partial Latin squares ⋮ The complexity of completing partial Latin squares ⋮ Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results ⋮ Embedding an incomplete latin square in a latin square with a prescribed diagonal ⋮ On the intricacy of combinatorial construction problems ⋮ Completions of ε-Dense Partial Latin Squares ⋮ Redundant disequalities in the Latin square problem
Cites Work
