Back
Bipartite Complete Induced Subgraphs of a Random Graph
Authors:
- Zbigniew Palka
Abstract
Let G(n, p) denote a random graph on n labelled vertices in which the edges are chosen independently and with a fixed probability p. We study the number of vertices in the largest bipartite complete induced subgraph of a random graph G(n, p). Also we find those natural numbers which are likely to occur as orders of maximal bipartite complete induced subgraphs of G(n, p). © 1985, Elsevier Inc. All rights reserved.
- Record ID
- UAM7c6507bcb0c34fb3a57cf7efce6090b2
- Author
- Pages
- 209-219
- Book
- North-Holland Mathematics Studies, North-Holland Mathematics Studies, 1985, 209-219 p.
- ASJC Classification
- DOI
- DOI:10.1016/S0304-0208(08)73622-3 Opening in a new tab
- Language
- (en) English
- Score (nominal)
- 3
- Publication indicators
- = 0; : 1999 = 0.000
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAM7c6507bcb0c34fb3a57cf7efce6090b2/
- URN
urn:amu-prod:UAM7c6507bcb0c34fb3a57cf7efce6090b2
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or PerishOpening in a new tab system.