𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chaotic Numbers of Complete Bipartite Graphs and Tripartite Graphs

✍ Scribed by N. P. Chiang

Publisher
Springer
Year
2006
Tongue
English
Weight
147 KB
Volume
131
Category
Article
ISSN
0022-3239

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

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

The maximal number of induced complete b
The maximal number of induced complete bipartite graphs
✍ BΓ©la BollobΓ‘s; ChiΓͺ Nara; Shun-ichi Tachibana πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 230 KB

The aim of this paper is to determine the maximal number of induced K(t, t) subgraphs in graphs of given order and in graphs of given size. Given a graph G and a natural number t, denote by ft(G) the number of induced subgraphs of G isomorphic to K(t, t). Our notation is that of ; in particular, K(