Dense graphs with cycle neighborhoods (Q1892847): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q162994 |
Changed an Item |
||
| Property / author | |||
| Property / author: Seress, Ákos / rank | |||
Normal rank | |||
Revision as of 23:28, 9 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dense graphs with cycle neighborhoods |
scientific article |
Statements
Dense graphs with cycle neighborhoods (English)
0 references
2 July 1995
0 references
For all \(\varepsilon > 0\), we construct graphs with \(n\) vertices and \(> n^{2-\varepsilon}\) edges, for arbitrarily large \(n\), such that the neighborhood of each vertex is a cycle. This result is asymptotically best possible.
0 references
dense graphs
0 references
cycle neighborhoods
0 references
clean triangulation
0 references
extremal graph
0 references
neighborhood
0 references
cycle
0 references
