Measures on monotone properties of graphs

被引：13

作者：

Balogh, J

Bollobás, B

Weinreich, D

机构：

[1] Gettysburg Coll, Dept Math, Gettysburg, PA 17325 USA

[2] Memphis State Univ, Dept Math Sci, Memphis, TN 38152 USA

[3] Univ Cambridge Trinity Coll, Cambridge CB2 1TQ, England

来源：

DISCRETE APPLIED MATHEMATICS | 2002年 / 116卷 / 1-2期

基金：

匈牙利科学研究基金会; 美国国家科学基金会;

关键词：

extremal graph theory; graph properties; monotone; hereditary; speed; size;

D O I：

10.1016/S0166-218X(01)00175-5

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Given a monotone property P of graphs, write P-n for the set of graphs with vertex set [n] having property P. Building on recent results in the enumeration of graphical properties, we prove numerous results about the structure of graphs in P-n and the functions \P-n\. We also examine the measure e(p)(n), the maximum number of edges in a graph of P-n. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：17 / 36

页数：20

共 24 条

[1]

Alekseev V.E., 1992, DISCRETE MATH APPL, V4, P148, DOI 10.1515/dma.1993.3.2.191

[2] The speed of hereditary properties of graphs [J].