Back
Convex hulls of dense balanced graphs
Authors:
- Tomasz Łuczak,
- Andrzej Ruciński
Abstract
For several graph families F, we establish asymptotic estimates for the maximum possible number of extreme points that can be in the convex hull of an n-vertex graph in F. In particular, this is done when F is the set of balanced graphs, and when F> is the set of balanced graphs with N = N(n) edges. Similar results are obtained for strictly balanced, strongly balanced and strictly strongly balanced graphs. © 1992.
- Record ID
- UAMa0ac5af6d8e4485fb12e75ec0a26bd54
- Author
- Journal series
- Journal of Computational and Applied Mathematics, ISSN 0377-0427
- Issue year
- 1992
- Vol
- 41
- No
- 1-2
- Pages
- 205-213
- ASJC Classification
- ;
- DOI
- DOI:10.1016/0377-0427(92)90250-2 Opening in a new tab
- URL
- https://www.sciencedirect.com/science/article/pii/0377042792902502?via%3Dihub Opening in a new tab
- Language
- (en) English
- File
-
- File: 1
- 1-s2.0-0377042792902502-main.pdf
-
- Score (nominal)
- 0
- Score source
- journalList
- Publication indicators
- = 2; = 1; = 3; : 1999 = 0.870; : 2006 (2 years) = 0.759 - 2007 (5 years) =0.983
- Citation count
- 3
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAMa0ac5af6d8e4485fb12e75ec0a26bd54/
- URN
urn:amu-prod:UAMa0ac5af6d8e4485fb12e75ec0a26bd54
* 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.