当前位置:
X-MOL 学术
›
Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Inverting the Turán problem with chromatic number
Discrete Mathematics ( IF 0.8 ) Pub Date : 2021-06-18 , DOI: 10.1016/j.disc.2021.112517 Xiutao Zhu , Yaojun Chen
中文翻译:
用色数反转图兰问题
更新日期:2021-06-18
Discrete Mathematics ( IF 0.8 ) Pub Date : 2021-06-18 , DOI: 10.1016/j.disc.2021.112517 Xiutao Zhu , Yaojun Chen
For a graph G and a family of graphs , the Turán number is defined to be the maximum number of edges among all -free subgraphs of G. Inverting this problem, Briggs and Cox (2019) [5] studied the extremal function , where is the size of G, and suggested to investigate the extremal function , where denotes the chromatic number of G. Let be a complete graph of order n and H a given graph. In this paper, we establish a tight general upper bound for and conjecture for . We also confirm this conjecture for many instances of H.
中文翻译:
用色数反转图兰问题
对于图G和图族,图兰数 定义为所有边中的最大边数 G 的-free 子图。Briggs and Cox (2019) [5] 研究了这个问题的极值函数, 在哪里 是G的大小,建议研究极值函数, 在哪里 表示G的色数。让是顺序的一个完全图Ñ和ħ给定的曲线图。在本文中,我们为 和猜想 为了 . 我们还对H 的许多实例证实了这一猜想。