New exact values of the maximum size of graphs free of topological complete subgraphs (Q870962): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.07.031 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035328755 / rank | |||
Normal rank | |||
Revision as of 02:07, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New exact values of the maximum size of graphs free of topological complete subgraphs |
scientific article |
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
