𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The competition numbers of complete tripartite graphs

✍ Scribed by Suh-Ryung Kim; Yoshio Sano

Book ID
108112758
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
300 KB
Volume
156
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the number of triangular embeddings o
On the number of triangular embeddings of complete graphs and complete tripartite graphs
✍ M. J. Grannell; M. Knor πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 159 KB

## Abstract We prove that for every prime number __p__ and odd __m__>1, as __s__β†’βˆž, there are at least __w__ face 2‐colorable triangular embeddings of __K__~__w, w, w__~, where __w__ = __m__Β·__p__^__s__^. For both orientable and nonorientable embeddings, this result implies that for infinitely many

On bounds for size Ramsey numbers of a c
On bounds for size Ramsey numbers of a complete tripartite graph
✍ Izolda Gorgol πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 146 KB

It will be shown that the (diagonal) size Ramsey number of K ..... is bounded below by c. 64n , 2 3oj2 ~n 2 and above by 2 Let F and G be graphs. The symbol F >---,G denotes that in any two-colouring (say red and blue) of edges of F a monochromatic copy of G is contained. The Ramsey number r(G) is t