THE NUMBER OF EDGES IN A MAXIMUM GRAPH WITH UNI-LENGTH CYCLES

被引:0
|
作者
施永兵
机构
[1] Department of Mathematics
[2] Shanghai Teachers University
关键词
length; THE NUMBER OF EDGES IN A MAXIMUM GRAPH WITH UNI-LENGTH CYCLES;
D O I
暂无
中图分类号
学科分类号
摘要
In 1975, Erds raised the following problem: Let f(n) be the maximum possible number of edges in a graph on n vertices in which there are no two cycles having the same length. Determine f(n).
引用
收藏
页码:1831 / 1832
页数:2
相关论文
共 50 条