Completing partial Latin squares with one nonempty row, column, and symbol
The electronic journal of combinatorics, Tome 23 (2016) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $r,c,s\in\{1,2,\ldots,n\}$ and let $P$ be a partial latin square of order $n$ in which each nonempty cell lies in row $r$, column $c$, or contains symbol $s$. We show that if $n\notin\{3,4,5\}$ and row $r$, column $c$, and symbol $s$ can be completed in $P$, then a completion of $P$ exists. As a consequence, this proves a conjecture made by Casselgren and Häggkvist. Furthermore, we show exactly when row $r$, column $c$, and symbol $s$ can be completed.
DOI : 10.37236/5675
Classification : 05B15, 05A05
Mots-clés : partial Latin square, completing

Jaromy Kuhl  1   ; Michael W. Schroeder  2

1 University of West Florida
2 Marshall University
@article{10_37236_5675,
     author = {Jaromy Kuhl and Michael W. Schroeder},
     title = {Completing partial {Latin} squares with one nonempty row, column, and symbol},
     journal = {The electronic journal of combinatorics},
     year = {2016},
     volume = {23},
     number = {2},
     doi = {10.37236/5675},
     zbl = {1335.05028},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/5675/}
}
TY  - JOUR
AU  - Jaromy Kuhl
AU  - Michael W. Schroeder
TI  - Completing partial Latin squares with one nonempty row, column, and symbol
JO  - The electronic journal of combinatorics
PY  - 2016
VL  - 23
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/5675/
DO  - 10.37236/5675
ID  - 10_37236_5675
ER  - 
%0 Journal Article
%A Jaromy Kuhl
%A Michael W. Schroeder
%T Completing partial Latin squares with one nonempty row, column, and symbol
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/5675/
%R 10.37236/5675
%F 10_37236_5675
Jaromy Kuhl; Michael W. Schroeder. Completing partial Latin squares with one nonempty row, column, and symbol. The electronic journal of combinatorics, Tome 23 (2016) no. 2. doi: 10.37236/5675

Cité par Sources :