From Random Graphs to Graph Theory
Authors:
- Andrzej Ruciński
Abstract
Four graph theoretic problems, all born in the theory of random graphs, are presented. They have been stimulated by investigations of the existence and distribution of subgraphs of given type contained in the binomial random graph. The deterministic problems involve only the notions of a subgraph, subgraph count, and subgraph density and deal with balanced extensions of graphs, convex hulls, globally sparsest Ramsey graphs (in vertex-coloring case) and so called p-proportional graphs. © 1993, Elsevier Science & Technology.
- Record ID
- UAMa876a6154c984adc993584b30ea93857
- Author
- Pages
- 265-273
- Book
- Annals of Discrete Mathematics, Annals of Discrete Mathematics, 1993, 265-273 p.
- ASJC Classification
- DOI
- DOI:10.1016/S0167-5060(08)70394-7 Opening in a new tab
- Language
- (en) English
- Score (nominal)
- 3
- Publication indicators
- = 0; : 2005 = 0.000
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAMa876a6154c984adc993584b30ea93857/
- URN
urn:amu-prod:UAMa876a6154c984adc993584b30ea93857
* 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.