A Turán-type Extremal Theory of Convex Geometric Graphs-Reference-Cited by-同舟云学术

A Turán-type Extremal Theory of Convex Geometric Graphs

Published:2003 Issue: Volume: Page:275-300
ISSN:0937-5511
Container-title:Algorithms and Combinatorics
language:
Short-container-title:

Author:

Brass Peter,Károlyi Gyula,Valtr Pavel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-55566-4_12.pdf

Reference31 articles.

1. B.M. ´Abrego and S. Fern´andez-Merchant: The unit distance problem for centrally symmetric convex polygons, Discr. Comput. Geom. 28 (2002), 467¨C473.

2. N. Alon, L. R´onyai, and T. Szab´o: Norm-graphs: Variations and applications, J. Comb. Theory, Ser. B 76 (1999), 280¨C290.

3. A. Bialostocki and H. Harborth: Ramsey colorings for diagonals of convex polygons, Abhandlungen der Braunschw. Wiss. Ges. 47 (1996), 159¨C163.

4. D. Bienstock and E. Győori: An extremal problem on sparse 0-1-matrices, SIAMJ. Discr. Math. 4 (1991), 17¨C27. Extremal Theory of Convex Geometric Graphs 299

5. B. Bollob´as: Modern Graph Theory, Springer, 1998.

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

1. On asymptotic packing of convex geometric and ordered graphs;Journal of Graph Theory;2023-07-10

2. Saturation of Ordered Graphs;SIAM Journal on Discrete Mathematics;2023-06-16

3. On edge-ordered graphs with linear extremal functions;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023

4. Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs;Acta Mathematica Hungarica;2021-09-03

5. Blockers for Simple Hamiltonian Paths in Convex Geometric Graphs of Odd Order;Discrete & Computational Geometry;2019-12-04