On the interval number of random graphs (Q923107)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the interval number of random graphs |
scientific article; zbMATH DE number 4170954
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the interval number of random graphs |
scientific article; zbMATH DE number 4170954 |
Statements
On the interval number of random graphs (English)
0 references
1990
0 references
The interval number of a graph G is defined as the smallest integer t such that G is an intersection graph of sets each of which is the union of t real intervals. The interval number is shown to be asymptotically equal to (n log 2)/(2 log n) for almost every graph.
0 references
multiple interval representation
0 references
interval number
0 references
intersection graph
0 references
