Abstract
A chordal graph is a graph in which every cycle of length at least 4 has a chord. If G is a random n-vertex labelled chordal graph, the size of the larget clique in about n/2 and deletion of this clique almost surely leaves only isolated vertices. This gives the asymptotic number of chordal graphs and information about a variety of things such as the size of the largest clique and connectivity.
Original language | English |
---|---|
Pages (from-to) | 214-221 |
Number of pages | 8 |
Journal | Journal of the Australian Mathematical Society |
Volume | 38 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1985 |
Externally published | Yes |