On extremal graphs without compatible triangles or quadrilaterals (Q1322244)
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 562644
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On extremal graphs without compatible triangles or quadrilaterals |
scientific article; zbMATH DE number 562644 |
Statements
On extremal graphs without compatible triangles or quadrilaterals (English)
0 references
28 August 1994
0 references
The paper is concerned with the following extremal problem in extremal graph theory: Given a graph \(H\), determine the maximal number of edges in a graph \(G\) on \(n\) vertices without a copy of \(H\).
0 references
triangles
0 references
quadrilaterals
0 references
extremal problem
0 references
extremal graph
0 references
0 references
0.7930061221122742
0 references
0.7873974442481995
0 references
