Publication | Closed Access
On colouring random graphs
340
Citations
2
References
1975
Year
EngineeringGraph TheoryRandom GraphExtremal Graph TheoryStructural Graph TheoryProbabilistic Graph Theoryω NNetwork AnalysisEducationRandom GraphsProbability TheoryComputer ScienceDiscrete MathematicsCombinatorial OptimizationPrescribed Probability P
Abstract Let ω n denote a random graph with vertex set {1, 2, …, n }, such that each edge is present with a prescribed probability p , independently of the presence or absence of any other edges. We show that the number of vertices in the largest complete subgraph of ω n is, with probability one,
| Year | Citations | |
|---|---|---|
Page 1
Page 1