What we know and what we do not know about Turán numbers

Author:

Sidorenko Alexander

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference58 articles.

1. Boyer, E.D., Kreher, D.L., Radziszowski, S.P., Zou, J., and Sidorenko, A.: On (n, 5, 3)-Turán systems. Ars Combinatoria37, 1–19 (1994)

2. Brown, W.G.: On an open problem of Paul Turán concerning 3-graphs. In: Studies in pure mathematics, pp. 91–93. Basel-Boston, Mass.: Birkhäuser 1983

3. Caen, D. de: Extension of a theorem of Moon and Moser on complete subgraphs. Ars Combinatoria16, 5–10 (1983)

4. Caen, D. de: A note on the probabilistic approach to Turán's problem. J. Comb. TheoryB 34, 340–349 (1983)

5. Caen, D. de: The current status of Turán's problem on hypergraphs. In: Extremal Problems for Finite Sets, Visegrád (Hungary), 1991, Bolyai Society Mathematical Studies, Vol. 3, pp. 187–197

Cited by 100 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Turán numbers of r-graphs on r + 1 vertices;Journal of Combinatorial Theory, Series B;2024-11

2. One Turán Type Problem on Uniform Hypergraphs;Axioms;2024-08-11

3. Matroid Horn functions;Journal of Combinatorial Theory, Series A;2024-04

4. Edge‐minimum saturated k‐planar drawings;Journal of Graph Theory;2024-03-28

5. Hypergraphs with Infinitely Many Extremal Constructions;DISCRETE ANAL;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3