On extremal graphs without compatible triangles or quadrilaterals (Q1322244): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5545296 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs with Hamiltonian cycles having adjacent lines different colours / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs with cycles having adjacent lines different colors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Eulerian graphs and related topics. Part 1, Volume 2 / rank | |||
Normal rank | |||
Latest revision as of 14:32, 22 May 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
0 references
