Graphs without quadrilaterals |
| |
Authors: | Z Füredi |
| |
Affiliation: | Mathematical Institute of the Hungarian Academy of Sciences, Budapest 1376 Pf. 428, Hungary |
| |
Abstract: | Let f(n) denote the maximum number of edges of a graph on n vertices not containing a circuit of length 4. It is well known that . The old conjecture is proved for infinitely many q (whenever q = 2k). |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|