Ordered and convex geometric trees with linear extremal function

DOI10.1007/s00454-019-00149-zzbMath1447.05060arXiv1812.05750OpenAlexW2984350154MaRDI QIDQ2197686

Dhruv Mubayi, Alexandr V. Kostochka, Zoltan Fueredi, Jacques Verstraete

Publication date: 1 September 2020

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.05750

zbMATH Keywords

Turán numberordered graphsconvex geometric graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal set theory (05D05)

Related Items (5)

Extremal problems for pairs of triangles ⋮ Tilings in vertex ordered graphs ⋮ On asymptotic packing of convex geometric and ordered graphs ⋮ Saturation problems in convex geometric hypergraphs ⋮ Extremal problems for convex geometric hypergraphs and ordered hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees of nonlinearity in forbidden 0-1 matrix problems
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Davenport-Schinzel theory of matrices
• Extremal theory for convex matchings in convex geometric graphs
• On 0-1 matrices and small excluded submatrices
• Construction of Locally Plane Graphs with Many Edges
• An Extremal Problem on Sparse 0-1 Matrices
• Forbidden patterns and unit distances
• On the Turán number of ordered forests

This page was built for publication: Ordered and convex geometric trees with linear extremal function