On the edge distribution in triangle-free graphs
type: Item
instance of: scholarly article
title: On the edge distribution in triangle-free graphs
zbMATH Open document ID: 0824.05033
author: Michael Krivelevich
published in: Journal of Combinatorial Theory. Series B
publication date: 1995-07-02T00:00:00Z
review text: Let \(G\) be a graph on \(n\) vertices. The author shows that if any subgraph of \(G\) induced by \(n/2\) vertices is of size at least \(n^ 2/36\) then \(G\) contains a triangle. Further, it is studied how much the edge distribution in a triangle-free graph deviates from the edge distribution in a typical random graph of the same order and size.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 767693
zbMATH Keywords: triangle
zbMATH Keywords: edge distribution
zbMATH Keywords: triangle-free graph
zbMATH Keywords: random graph
reviewed by: Peter Horák
MaRDI profile type: Publication
full work available at URL: jctb.1995.1018
OpenAlex ID: W2056840457
DOI: 10.1006/JCTB.1995.1018
description: scientific article; zbMATH DE number 767693