On a generalization of the Evans Conjecture (Q942105): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.08.091 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1988915394 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q122900270 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Thank Evans! / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4529303 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Completing some partial Latin squares / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4677944 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Embedding Incomplete Latin Squares / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3861414 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Combinatorial Theorem with an Application to Latin Rectangles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3924220 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:12, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a generalization of the Evans Conjecture |
scientific article |
Statements
On a generalization of the Evans Conjecture (English)
0 references
4 September 2008
0 references
Evan's Conjecture said that an \(n \times n\) square with at most \(n-1\) entries predetermined without contradiction can be completed to an \(n \times n\) Latin square. An \(r\)-multi Latin square is a square of order \(n\) where each cell has \(r\) symbols from an \(nr\)-set so that in each row and column every symbol appears exactly once. The authors show here that any partial \(r\)-multi Latin square with of order \(n\) with at most \(n-1\) cells predetermined without contradiction can be completed to an \(r\)-multi Latin square.
0 references
Evan's conjecture
0 references
complete partial \(r\)-multi Latin square
0 references