✦ LIBER ✦

On the number of unique subgraphs of a graph

✍ Scribed by A.E Brouwer

Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 107 KB
Volume: 18
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(75)90047-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of unique subgraphs

✍ Frank Harary; Allen J Schwenk 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 199 KB

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

On the number of distinct induced subgra

On the number of distinct induced subgraphs of a graph

✍ P. Erdős; A. Hajnal 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 582 KB

On the number of induced subgraphs of a

On the number of induced subgraphs of a random graph

✍ Hiroshi Maehara 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 175 KB

On the chromatic number of a graph with

On the chromatic number of a graph with two forbidden subgraphs

✍ Medha Dhurandhar 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 333 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 \_(