𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On graphs with unique subgraphs

✍ Scribed by Madhukar G Deshpande

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
187 KB
Volume
17
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On planar intersection graphs with forbi
On planar intersection graphs with forbidden subgraphs
✍ JΓ‘nos Pach; Micha Sharir πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 154 KB

## Abstract Let ${\cal C}$ be a family of __n__ compact connected sets in the plane, whose intersection graph $G({\cal C})$ has no complete bipartite subgraph with __k__ vertices in each of its classes. Then $G({\cal C})$ has at most __n__ times a polylogarithmic number of edges, where the exponent

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 graphs with subgraphs having large in
On graphs with subgraphs having large independence numbers
✍ Noga Alon; Benny Sudakov πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 131 KB

## Abstract Let __G__ be a graph on __n__ vertices in which every induced subgraph on ${s}={\log}^{3}\, {n}$ vertices has an independent set of size at least ${t}={\log}\, {n}$. What is the largest ${q}={q}{(n)}$ so that every such __G__ must contain an independent set of size at least __q__? This

Graphs with unavoidable subgraphs with l
Graphs with unavoidable subgraphs with large degrees
✍ L. Caccetta; P. ErdΓΆs; K. Vijayan πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 360 KB

Let %(n, rn) denote the class of simple graphs on n vertices and rn edges and let G E %(n, rn). There are many results in graph theory giving conditions under which G contains certain types of subgraphs, such as cycles of given lengths, complete graphs, etc. For example, Turan's theorem gives a suff