** Next:** Other Classes of Graphs
** Up:** Specific Class of Graphs
** Previous:** Treewidth Bounded Graphs
** Contents**

##

Random Graphs

The class
denotes the classic model of *n*-node random
graphs, where *p* represents the probability to have an edge between
any two nodes.

The next result includes the case *p*=1/2, and shows that almost all
*n*-node graphs have constant compactness.

**Open question 10**
*
*

- Do almost all *n*-node graphs have compactness 1?

*
*

*2000-03-21*