On the number of edges of quadrilateral-free graphs (Q1924153): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1996.0052 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016480989 / rank | |||
Normal rank | |||
Revision as of 01:39, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of edges of quadrilateral-free graphs |
scientific article |
Statements
On the number of edges of quadrilateral-free graphs (English)
0 references
23 March 1997
0 references
Let \(f(n)\) be the maximum number of edges in a graph of order \(n\) without four-cycles. It has been known that asymptotically \(f(n)\sim n^{3/2}\). In the paper it is proved that \(f(q^2+q+1)\leq q(q+1)^2/2\) for all \(q>13\). Moreover, if \(q\) is a prime power greater than 13, we get equality in the formula.
0 references
four-cycles
0 references
