Dense graphs with cycle neighborhoods (Q1892847)
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 767695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dense graphs with cycle neighborhoods |
scientific article; zbMATH DE number 767695 |
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
0.7900366187095642
0 references
0.7748309969902039
0 references
0.7659094333648682
0 references
