Thank Evans!

DOI10.1112/PLMS/S3-47.3.507MaRDI QIDQ3222202zbMATHOpenAlexFDO

Authors Lars Døvling Andersen, A. J. W. Hilton

Publication date 1983

Published in Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/plms/s3-47.3.507

zbMATH Keywords

completionlatin square

Mathematics Subject Classification ID

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

Recommendations

• Symmetric latin square and complete graph analogues of the evans conjecture
• Completing some partial Latin squares
• On a generalization of the Evans Conjecture
• On completing partial Latin squares with two filled rows and at least two filled columns
• scientific article; zbMATH DE number 4025451

Cited in

(41)

• On the completability of incomplete Latin squares
• Avoiding and extending partial edge colorings of hypercubes
• Completing partial Latin squares with two cyclically generated prescribed diagonals
• Development of one approach to constructing a set of block bijective transformations
• On Smetaniuk's Construction for Latin Squares and the Andersen-Hilton Theorem
• On avoiding some families of arrays
• Embedding an incomplete latin square in a latin square with a prescribed diagonal
• On completing latin squares
• Completing partial Latin squares with one nonempty row, column, and symbol
• Decomposition of bicolored square arrays into bichromatic diagonals
• Some results on generalized Latin squares
• Restricted extension of sparse partial edge colorings of complete graphs
• Maximal partial Latin cubes
• On the intricacy of combinatorial construction problems
• Extending partial edge colorings of iterated Cartesian products of cycles and paths
• Covers and partial transversals of Latin squares
• Embedding partial Mendelsohn triple systems
• On a generalization of the Evans Conjecture
• Completion and deficiency problems
• A generalization of interval edge-colorings of graphs
• Edge precoloring extension of trees
• Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice
• The \(n\)-queens completion problem
• Completing partial Latin squares with prescribed diagonals.
• Restricted extension of sparse partial edge colorings of hypercubes
• scientific article; zbMATH DE number 16253 (Why is no real title available?)
• Decomposition of bi-colored square arrays into balanced diagonals
• Refinements of Hall's condition
• An Evans-style result for block designs
• Extending Latin rectangles with restraints
• scientific article; zbMATH DE number 6383870 (Why is no real title available?)
• scientific article; zbMATH DE number 7535772 (Why is no real title available?)
• Restricted edge-colourings of bipartite graphs
• Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results
• Hamiltonian double Latin squares
• On avoiding odd partial Latin squares and \(r\)-multi Latin squares
• One approach to constructing a transitive class of block transformations
• On the intricacy of avoiding multiple-entry arrays
• Clique decompositions of multipartite graphs and completion of Latin squares
• Completing partial Latin squares with blocks of non-empty cells
• Completing some partial Latin squares

This page was built for publication: Thank Evans!

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