-
34浏览
-
0点赞
-
0收藏
-
0分享
-
264下载
-
0评论
-
引用
期刊论文
Extremal Graphs Without Three-Cycles, Four-Cycles or Five-Cycles*
,-0001,():
Given a set of graphs Ψ={G1, G2, …, Gk}, let ex(n; Ψ) denote the greatest size of a graph with order n that contains no subgraph isomorphic to some Gi, 1≤i≤k. One of the main classes of problems in extremal graph theory, known as Tuŕan-type problems, is for given n, Ψ to determine explicitly the function ex (n, Ψ), or to find its asymptotic behavior. Yang Yuansheng investigated the values of ex(n, Ψ) for Ψ={C4} (UTILITAS MATHEMATICA, 41 (1992), 204-210), Garnick investigated them for Ψ={C3, C4} (Journal of Graph Theory, vol.17, no.5 (1993), 633-645) and Alabdullatif investigated them for Ψ={Cn-k+1, …, Cn and Ψ={Pn-k+1,…, Pn}, (1≤k≤n-2) (Bull. Inst. Combin. Appl., 25 (1999)41-52). This paper investigates the values of ex (n, Ψ) forΨ={C3, C4, C5}, n≤42.
【免责声明】以下全部内容由[杨元生]上传于[2005年01月27日 00时37分03秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果