The maximum size of graphs satisfying a degree condition (Q1196997)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The maximum size of graphs satisfying a degree condition |
scientific article; zbMATH DE number 89872
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum size of graphs satisfying a degree condition |
scientific article; zbMATH DE number 89872 |
Statements
The maximum size of graphs satisfying a degree condition (English)
0 references
16 January 1993
0 references
The note enlarges the simple graphs family satisfying Krol and Veldman's inequality connected with upper bound of size of graphs. It is achieved by lemma and theorem proof, eliminating requirement (i): (i) all studied graphs are critically \(h\)-connected, and by transforming equality (ii): (ii) every vertex of graph \(G\) is adjacent to a vertex with degree \(h\) into inequality: every vertex of \(G\) is adjacent to a vertex with degree not more then ``\(h\)''.
0 references
maximum size
0 references
degree condition
0 references
order
0 references
size of graph
0 references
connectivity
0 references
bound
0 references
