On the edge distribution in triangle-free graphs (Q1892845)
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 767693
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the edge distribution in triangle-free graphs |
scientific article; zbMATH DE number 767693 |
Statements
On the edge distribution in triangle-free graphs (English)
0 references
2 July 1995
0 references
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.
0 references
triangle
0 references
edge distribution
0 references
triangle-free graph
0 references
random graph
0 references
0.812519907951355
0 references
0.8064936399459839
0 references
0.8039732575416565
0 references
0.8035324215888977
0 references
