๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Handle bases and bounds on the number of subgraphs

โœ Scribed by John Donald; John Elwin; Richard Hager; Peter Salamon

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
788 KB
Volume
42
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 unique subgraphs
On the number of unique subgraphs
โœ Frank Harary; Allen J Schwenk ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 199 KB
On the Density of Subgraphs in a Graph w
On the Density of Subgraphs in a Graph with Bounded Independence Number
โœ Pavel Valtr ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 260 KB

Let \_(n, m, k) be the largest number \_ # [0, 1] such that any graph on n vertices with independence number at most m has a subgraph on k vertices with at lest \_ } ( k 2 ) edges. Up to a constant multiplicative factor, we determine \_(n, m, k) for all n, m, k. For log n m=k n, our result gives \_(

Forbidden subgraphs and bounds on the si
Forbidden subgraphs and bounds on the size of a maximum matching
โœ Michael D. Plummer; Akira Saito ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 126 KB ๐Ÿ‘ 1 views

## Abstract Let __K__~1,__n__~ denote the star on __n__โ€‰+โ€‰1 vertices; that is, __K__~1,__n__~ is the complete bipartite graph having one vertex in the first vertex class of its bipartition and __n__ in the second. The special graph __K__~1,3~, called the __claw__, has received much attention in the