𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotically large -graphs

✍ Scribed by Eduardo A. Canale; José Gómez

Book ID
108112520
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
282 KB
Volume
152
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proximity graphs inside large weighted g
Proximity graphs inside large weighted graphs
✍ Bernardo M. Ábrego; Ruy Fabila-Monroy; Silvia Fernández-Merchant; David Flores-P 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 217 KB
Asymptotic enumeration of full graphs
Asymptotic enumeration of full graphs
✍ D. J. Kleitman; F. R. Lasaga; L. J. Cowen 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 539 KB

## Abstract A __full graph__ on __n__ vertices, as defined by Fulkerson, is a representation of the intersection and containment relations among a system of __n__ sets. It has an undirected edge between vertices representing intersecting sets, and a directed edge from __a__ to __b__ if the correspo

Asymptotic results on saturated graphs
Asymptotic results on saturated graphs
✍ Miroslaw Truszczynski; Zsolt Tuza 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 449 KB

Truszczynski, M. and Z. Tuza, Asymptotic results on saturated graphs, Discrete Mathematics 87 (1991) 309-314 Let F be a given graph. A graph G is called F-saturated if F & G and F c G + e for every edge e $ E(G), e E V(G). Denote by sat(n, F) the minimum number of edges in an F-saturated graph on n