## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G__. Let __i(G)__ denote the number of maximal independent sets of __G__. Here, we prove two conjectures, suggested by P. ErdΓΆs, that the maximum number of m
β¦ LIBER β¦
On the maximal number of independent triangles in graphs
β Scribed by G. A. Dirac
- Book ID
- 112965378
- Publisher
- Vandenhoeck & Ruprecht
- Year
- 1963
- Tongue
- German
- Weight
- 273 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0025-5858
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Constraints on the number of maximal ind
β
Jiuqiang Liu
π
Article
π
1994
π
John Wiley and Sons
π
English
β 387 KB
π 2 views
On the Maximal Number of Edges in Graphs
β
Sauer, N.
π
Article
π
1971
π
Oxford University Press
π
English
β 98 KB
The number of maximal independent sets i
β
ZoltΓ‘n FΓΌredi
π
Article
π
1987
π
John Wiley and Sons
π
English
β 286 KB
π 2 views
Generalizing a theorem of Moon and Moser. we determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50. = I .32. . .). Example 1.2. Let b, = i(C,), where C,z denotes the circuit of length n. Then b, = 3, 6, = 2, b, = 5, and b,
On the maximal number of independent cir
β
K. CorrΓ‘di; A. Hajnal
π
Article
π
1963
π
Akadmiai Kiad
π
English
β 776 KB
On the maximal number of independent cir
β
G. Dirac; P. ErdΓ΅s
π
Article
π
1963
π
Akadmiai Kiad
π
English
β 898 KB
A note on the independence number of tri
β
James B. Shearer
π
Article
π
1983
π
Elsevier Science
π
English
β 188 KB