On extremal graphs without compatible triangles or quadrilaterals (Q1322244): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:21, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On extremal graphs without compatible triangles or quadrilaterals |
scientific article |
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
