Dense graphs with cycle neighborhoods
type: Item
instance of: scholarly article
title: Dense graphs with cycle neighborhoods
zbMATH Open document ID: 0820.05036
author: Tibor Szabó
author: Ákos Seress
published in: Journal of Combinatorial Theory. Series B
publication date: 1995-07-02T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 767695
zbMATH Keywords: dense graphs
zbMATH Keywords: cycle neighborhoods
zbMATH Keywords: clean triangulation
zbMATH Keywords: extremal graph
zbMATH Keywords: neighborhood
zbMATH Keywords: cycle
MaRDI profile type: Publication
full work available at URL: jctb.1995.1020
OpenAlex ID: W2024665949
DOI: 10.1006/JCTB.1995.1020
description: scientific article; zbMATH DE number 767695