No CrossRef data available.
Article contents
On the clique number of a random overlap graph
Published online by Cambridge University Press: 14 July 2016
Abstract
The behaviour of the size of the largest complete subgraph contained in an overlap graph of a random acyclic digraph is presented.
Keywords
MSC classification
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust 1994
Footnotes
Research partially supported by KBN grant 2 1087 91 01.
Supported in part by U.S. National Science Foundation grant BSR 87-05047 to Rockefeller University (principal investigator Joel E. Cohen).