Hostname: page-component-8448b6f56d-t5pn6 Total loading time: 0 Render date: 2024-04-16T03:31:59.215Z Has data issue: false hasContentIssue false
  • English
  • Français

On the clique number of a random overlap graph

Part of: Graph theory

Published online by Cambridge University Press:  14 July 2016

Tomasz Łuczak  and
Zbigniew Palka
Tomasz Łuczak
Affiliation:
Adam Mickiewicz University, Poznan
Zbigniew Palka
Affiliation:
Adam Mickiewicz University, Poznan
Get access Rights & Permissions [Opens in a new window]

Abstract

The behaviour of the size of the largest complete subgraph contained in an overlap graph of a random acyclic digraph is presented.

Keywords

ACYCLIC DIGRAPH

MSC classification

Primary: 05C80: Random graphs
Secondary: 05C20: Directed graphs (digraphs), tournaments
Type
Short Communications
Information
Journal of Applied Probability , Volume 31 , Issue 2 , June 1994 , pp. 582 - 588
Copyright
Copyright © Applied Probability Trust 1994 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

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).

References

[1] Andrews, G. E. (1976) The Theory of Partitions. Addison-Wesley, Reading. MA.Google Scholar
[2] Bollobás, B. (1985) Random Graphs. Academic Press, London.Google Scholar
[3] Cohen, J. and Palka, Z. (1990) A stochastic theory of community food webs: V. Intervality and triangulation in the trophic niche overlap graph. Amer. Naturalist 135, 435–463.CrossRefGoogle Scholar
[4] Erdös, P. and Rényi, A. (1960) On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 5, 17–61.Google Scholar