Title of article
A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
Author/Authors
Grannell، نويسنده , , M.J. and Griggs، نويسنده , , T.S.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
14
From page
637
To page
650
Abstract
We prove that, for a certain positive constant a and for an infinite set of values of n, the number of nonisomorphic triangular embeddings of the complete graph K n is at least n a n 2 . A similar lower bound is also given, for an infinite set of values of n, on the number of nonisomorphic triangular embeddings of the complete regular tripartite graph K n , n , n .
Keywords
Steiner triple system , Complete Graph , Latin square , Triangular embedding
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2008
Journal title
Journal of Combinatorial Theory Series B
Record number
1528716
Link To Document