|
|||||
|
|
On some extremal problems in graph theory |
|
| Authors: | P Erdös |
| Institution: | (1) Technion-Israel Institute of Technology, Haifa |
| Abstract: | The author proves that ifC is a sufficiently large constant then every graph ofn vertices and Cn 3/2] edges contains a hexagonX 1,X 2,X 3,X 4,X 5,X 6 and a seventh vertexY joined toX 1,X 3 andX 5. The problem is left open whether our graph contains the edges of a cube, (i.e. an eight vertexZ joined toX 2,X 4 andX 6). |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |