Abstract
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 eP(n), the maximum number of edges in a graph of P n.
Original language | English (US) |
---|---|
Pages (from-to) | 17-36 |
Number of pages | 20 |
Journal | Discrete Applied Mathematics |
Volume | 116 |
Issue number | 1-2 |
DOIs | |
State | Published - Jan 15 2002 |
Externally published | Yes |
Keywords
- Extremal graph theory
- Graph properties
- Hereditary
- Monotone
- Size
- Speed
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics