当前位置: X-MOL 学术J. Graph Theory › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Order plus size of τ‐critical graphs
Journal of Graph Theory ( IF 0.9 ) Pub Date : 2020-06-26 , DOI: 10.1002/jgt.22603
András Gyárfás 1 , Jenő Lehel 1, 2
Affiliation  

Let G = ( V , E ) be a τ ‐critical graph with τ ( G ) = t . Erdős and Gallai proved that V 2 t and the bound E t + 1 2 was obtained by Erdős, Hajnal, and Moon. We give here the sharp combined bound E + V t + 2 2 and find all graphs with equality.

中文翻译:

阶图加上τ临界图的大小

G = V Ë 成为 τ 关键图 τ G = Ť 。Erdős和Gallai证明了 V 2 Ť 和界限 Ë Ť + 1个 2 由Erdős,Hajnal和Moon获得。我们在这里给出了清晰的组合边界 Ë + V Ť + 2 2 并找到所有相等的图
更新日期:2020-06-26
down
wechat
bug