An example of a superproportional graph
作者:
Jan Kärrman,
期刊:
Random Structures&Algorithms
(WILEY Available online 1994)
卷期:
Volume 5,
issue 1
页码: 95-98
ISSN:1042-9832
年代: 1994
DOI:10.1002/rsa.3240050110
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractIn the theory of random graphs, several classes of graphs occur that are exceptional cases in limit theorems for subgraph counts. The purpose of this article is to show the existence of graphs in one of these classes, by providing an explicit, computer generated, example. We also show that the class is closed under complementation. © 1994 John Wiley&Sons, Inc
点击下载:
PDF
(176KB)
返 回