✦ LIBER ✦

Rotation numbers for complete tripartite graphs

✍ Scribed by Julie Haviland; Andrew Thomason

Publisher: Springer Japan
Year: 1991
Tongue: English
Weight: 710 KB
Volume: 7
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788140

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chaotic Numbers of Complete Bipartite Gr

Chaotic Numbers of Complete Bipartite Graphs and Tripartite Graphs

✍ N. P. Chiang 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 147 KB

More rotation numbers for complete bipar

More rotation numbers for complete bipartite graphs

✍ Béla Bollobás; E. J. Cockayne 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB

## Abstract Let __G__ be a simple undirected graph which has __p__ vertices and is rooted at __x__. Informally, the __rotation number h(G, x)__ of this rooted graph is the minimum number of edges in a __p__ vertex graph __H__ such that for each vertex __v__ of __H__, there exists a copy of __G__ in

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

Chromatic uniqueness of certain complete

Chromatic uniqueness of certain complete tripartite graphs

✍ G. C. Lau; Y. H. Peng 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 194 KB

Rotation numers for complete bipartite g

Rotation numers for complete bipartite graphs

✍ Julie Haviland; Andrew Thomason 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 510 KB

## Abstract A __rooted graph__ is a pair (__G, x__) where __G__ is a simple undirected graph and __x__ ϵ __V__(__G__). If __G__ if rooted at __x__, then its __rotation number h(G, x)__ is teh minimum number of edges in a graph __F__, of the same order as __G__, such that for all __v__ ϵ __V(F)__ we