Ordered and Convex Geometric Trees with Linear Extremal Function
Ordered and Convex Geometric Trees with Linear Extremal Function
复制标题
DOI：
10.1007/s00454-019-00149-z
复制
发表时间：
2018-12
影响因子：
0.8
通讯作者：
Z. Füredi;A. Kostochka;D. Mubayi;Jacques Verstraëte
中科院分区：
文献类型：
--
作者：
Z. Füredi;A. Kostochka;D. Mubayi;Jacques Verstraëte
有序凸几何无圈图F的极值函数和已被许多研究者广泛研究。基本的问题是确定何时和是线性的，后者由Károlyi-Valtr在2003年提出。在本文中，我们回答这两个问题的每一个treeF。本文给出了一类带棱边的有序树的禁止子图的刻画，并证明了对于所有时和对于。我们还描述了具有线性Turán数的凸几何树族，并证明了对于每一个凸几何树，
The extremal functionsandfor ordered and convex geometric acyclic graphsFhave been extensively investigated by a number of researchers. Basic questions are to determine whenandare linear inn, the latter posed by Brass–Károlyi–Valtr in 2003. In this paper, we answer both these questions for every treeF. We give a forbidden subgraph characterization for a familyof ordered trees withkedges, and show thatfor allwhenandfor. We also describe the familyof the convex geometric trees with linear Turán number and show that for every convex geometric tree,.