Extremal results for odd cycles in sparse pseudorandom graphs
Extremal results for odd cycles in sparse pseudorandom graphs
复制标题
稀疏伪随机图中奇数循环的极值结果
DOI:
10.1007/s00493-014-2912-y
复制
发表时间:
2014
期刊:
影响因子:
1.1
通讯作者:
Mathias Schacht
中科院分区:
文献类型:
--
作者:
Elad Aigner-Horev;Hiêp Hàn;Mathias Schacht
We consider extremal problems for subgraphs of pseudorandom graphs. For graphsFandГthe generalized Turán densityπF(Г) denotes the relative density of a maximum subgraph ofГ, which contains no copy ofF. Extending classical Turán type results for odd cycles, we show thatπF(Г)=1/2 providedFis an odd cycle andГis a sufficiently pseudorandom graph.In particular, for (n,d,λ)-graphsГ, i.e.,n-vertex,d-regular graphs with all non-trivial eigenvalues in the interval [−λ,λ], our result holds for odd cycles of lengthℓ, providedUp to the polylog-factor this verifies a conjecture of Krivelevich, Lee, and Sudakov. For triangles the condition is best possible and was proven previously by Sudakov, Szabó, and Vu, who addressed the case whenFis a complete graph. A construction of Alon and Kahale (based on an earlier construction of Alon for triangle-free (n,d;λ)-graphs) shows that our assumption onГis best possible up to the polylog-factor for every oddℓ≥5.
登录
查看更多内容
DOI:
--
发表时间:
2007
期刊:
ACM-SIAM Symposium on Discrete Algorithms
影响因子:
--
作者:
G. Brightwell;K. Panagiotou;A. Steger
通讯作者:
A. Steger
影响因子:
3.9
作者:
J. Balogh;R. Morris;Wojciech Samotij
通讯作者:
J. Balogh;R. Morris;Wojciech Samotij
DOI:
--
发表时间:
2011
期刊:
Random Struct. Algorithms
影响因子:
--
作者:
Wojciech Samotij
通讯作者:
Wojciech Samotij
影响因子:
1
作者:
D. Conlon;W. T. Gowers;W. Samotij;M. Schacht
通讯作者:
M. Schacht
DOI:
--
发表时间:
2010
期刊:
影响因子:
--
作者:
D. Conlon;W. Gowers
通讯作者:
W. Gowers