EUVIMEDEUVIMED entdecken
Crossref

A superlinear lower bound for the size of a critical set in a latin square

Nicholas J. Cavenagh

Journal of Combinatorial Designs · 2007-07 · 15 (4) · 269-282

DOI: 10.1002/jcd.20152 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Combinatorial Designs, online erschienen am 27.04.2007. Verfasst von Nicholas J. Cavenagh. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 11 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A critical set is a partial latin square that has a unique completion to a latin square, and is minimal with respect to this property. Let scs ( n ) denote the smallest possible size of a critical set in a latin square of order n . We show that for all n , $scs(n)\geq n\lfloor (\log{n})^{1/3}/2\rfloor$ . Thus scs ( n ) is superlinear with respect to n . We also show that scs( n ) ≥ 2 n −32 and if n ≥ 25, ${\rm scs}(n)\geq \lceil (3n-7)/2 \rceil$ . © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 269–282, 2007

Zitieren

APA

Cavenagh, N. J. (2007). A superlinear lower bound for the size of a critical set in a latin square. Journal of Combinatorial Designs, 15(4), 269-282. https://doi.org/10.1002/jcd.20152

Vancouver

Cavenagh NJ. A superlinear lower bound for the size of a critical set in a latin square. Journal of Combinatorial Designs. 2007;15(4):269-282. doi:10.1002/jcd.20152

BibTeX
@article{Cavenagh2007,
  author = {Cavenagh, Nicholas J.},
  title = {A superlinear lower bound for the size of a critical set in a latin square},
  journal = {Journal of Combinatorial Designs},
  year = {2007},
  volume = {15},
  number = {4},
  pages = {269--282},
  doi = {10.1002/jcd.20152}
}
Kostenlos starten →