New exact values of the maximum size of graphs free of topological complete subgraphs (Q870962)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5134172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New exact values of the maximum size of graphs free of topological complete subgraphs |
scientific article; zbMATH DE number 5134172 |
Statements
New exact values of the maximum size of graphs free of topological complete subgraphs (English)
0 references
15 March 2007
0 references
A generalization of the famous extremal problem of Turán asks for determining the number ex\((n,p)\), the maximum number of edges of a graph of order \(n\) not containing a graph homeomorphic to the complete graph on \(p\) vertices. In this paper the exact values of ex\((n,p)\) are given for \((7n+7)/12\leq p<(12n+1)/3\), provided that \(n-p\geq 15.\) The corresponding extremal graphs are described as well.
0 references
topological compete graph
0 references
extremal graphs
0 references
0 references
0.9019767
0 references
0.89739966
0 references
0.8947481
0 references
0.8870978
0 references
0.8867956
0 references
0.88499117
0 references
0.88318914
0 references
0.88259816
0 references
