Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Thengarnanchai, Pantaree"'
A simple proof on the number of $(3 \times n)$-Latin rectangles based on a set of $\lambda$ elements
Autor:
Thengarnanchai, Pantaree, Kaemawichanurat, Pawaton, Ruksasakchai, Watcharintorn, Klamsakul, Natawat
In 1980, Athreya, Pranesachar and Singhi established the chromatic polynomial of $(3 \times n)$-Latin rectangles whose entries based on a set $\{1, 2, ..., \lambda\}$ in which $\lambda \geq n$. Their proof requires M\"{o}bius inversion formula and la
Externí odkaz:
http://arxiv.org/abs/2407.07378
Autor:
Klamsakul, Natawat, Thengarnanchai, Pantaree, Suebtangjai, Mattanaporn, Kaewperm, Pailin, Songsuwan, Nuttanon, Kaemawichanurat, Pawaton
Counting the number of maximal independent sets of graphs was started over $50$ years ago by Erd\H{o}s and Mooser. The problem has been continuously studied with a number of variations. Interestingly, when the maximal condition of an independent set
Externí odkaz:
http://arxiv.org/abs/2202.11294
Autor:
Klamsakul, Natawat, Thengarnanchai, Pantaree, Suebtangjai, Mattanaporn, Kaewperm, Pailin, Songsuwan, Nuttanon, Kaemawichanurat, Pawaton
Publikováno v:
In Discrete Applied Mathematics 15 November 2023 339:234-280
