𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph

✍ Scribed by Barak, Amnon B.; Erdös, Paul

Book ID
118212459
Publisher
Society for Industrial and Applied Mathematics
Year
1984
Weight
589 KB
Volume
5
Category
Article
ISSN
0196-5212

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of vertices of given degre
On the number of vertices of given degree in a random graph
✍ Zbigniew Palka 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor

The number of maximal independent sets i
The number of maximal independent sets in a connected graph
✍ Jerrold R. Griggs; Charles M. Grinstead; David R. Guichard 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 1021 KB

We determine the maximum on n vertices can have, and we a question of Wilf. number of maximal independent sets which a connected graph completely characterize the extremal graphs, thereby answering \* Partially supported by NSF grant number DIMS-8401281. t Partially supported by NSF grant number D S