吉首大学学报（自然科学版）2019，Vol.40Issue(5)：10-12,17,4.DOI:10.13438/j.cnki.jdzk.2019.05.002
满足Ore-型条件图的最小边数
Minimum Size of Graphs Satisfying Ore Condition
摘要
Abstract
Determining the extremal graph under a given parameter is a classic topic in extremal graph theory.We determine the minimum size of graphs satisfying Ore condition and obtain a partial result for the minimum size of graphs satisfying Ore-type condition关键词
Ore-条件/极值图/图的最少边数Key words
Ore condition/extremal graph/minimum size of graphs分类
数理科学引用本文复制引用
郝琛,杨卫华..满足Ore-型条件图的最小边数[J].吉首大学学报（自然科学版）,2019,40(5):10-12,17,4.基金项目
National Science Foundation of China (11671296) （11671296）
Shanxi Scholarship Council of China and Program for the Innovative Talents of Higher Learning Institutions of Shanxi （）
