When is a partial Latin square uniquely completable, but not its completable product? (Q924972): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5466089 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2770450 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2707961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4346244 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4017176 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4488564 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4529504 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4262245 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4552207 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On defining numbers of vertex colouring of regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4309104 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4876983 / rank | |||
Normal rank |
Latest revision as of 11:04, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | When is a partial Latin square uniquely completable, but not its completable product? |
scientific article |
Statements
When is a partial Latin square uniquely completable, but not its completable product? (English)
0 references
29 May 2008
0 references
Let \(P\) and \(Q\) be uniquely completable partial Latin squares. Determining necessary and sufficient conditions to ensure that the completable product \(P\otimes Q\) is itself uniquely completable remains an open problem. Previously some examples of \(P\) have been given such that \(P\otimes P\) does not have a unique completion. The authors provide a class of such examples by establishing that \(P\otimes P\) is not uniquely completable if the cells of the array of alternatives of \(P\), corresponding to cells of \(P\) not filled with an entry, all contain a set of size two except for one cell which has a set of size three.
0 references
partial Latin square
0 references
uniquely completable
0 references
critical set
0 references