𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the number of complete subgraphs contained in certain graphs

✍ Scribed by R.J Evans; J.R Pulham; J Sheehan

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
255 KB
Volume
30
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounds on the number of complete subgrap
Bounds on the number of complete subgraphs
✍ David C. Fisher; Jennifer Ryan πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 385 KB

Fisher, D.C. and J. Ryan, Bounds on the number of complete subgraphs, Discrete Mathematics 103 (1992) 313-320. Let G be a graph with a clique number w. For 1 s s w, let k, be the number of complete j subgraphs on j nodes. We show that k,,, c (j~l)(kj/(~))u""'. This is exact for complete balanced w-

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 the number of maximal bipartite subgr
On the number of maximal bipartite subgraphs of a graph
✍ Jesper Makholm Byskov; Bolette AmmitzbΓΈll Madsen; Bjarke Skjernaa πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 72 KB πŸ‘ 2 views

We show new lower and upper bounds on the maximum number of maximal induced bipartite subgraphs of graphs with n vertices. We present an infinite family of graphs having 105 n=10 % 1:5926 n ; such subgraphs show an upper bound of O(12 n=4 ) ΒΌ O(1:8613 n ) and give an algorithm that finds all maximal