On the Turán number of ordered forests

DOI10.1016/j.jcta.2019.01.006zbMath1414.05165OpenAlexW2964325648MaRDI QIDQ5920232

Craig Weidert, Gábor Tardos, Dániel Korándi, István Tomon

Publication date: 25 June 2019

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/101924/1/1711.07723v1.pdf

zbMATH Keywords

Turán problemforbidden submatrixordered forest

Mathematics Subject Classification ID

Partial orders, general (06A06) Paths and cycles (05C38)

Related Items (7)

Almost all permutation matrices have bounded saturation functions ⋮ Tilings in vertex ordered graphs ⋮ Polynomial removal lemmas for ordered graphs ⋮ Bipartite Turán problems for ordered graphs ⋮ Turán problems for edge-ordered graphs ⋮ Saturation Problems about Forbidden 0-1 Submatrices ⋮ Large Homogeneous Submatrices

Cites Work

• Unnamed Item
• Degrees of nonlinearity in forbidden 0-1 matrix problems
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Extremal functions of forbidden double permutation matrices
• Davenport-Schinzel theory of matrices
• Forbidden paths and cycles in ordered graphs and matrices
• On 0-1 matrices and small excluded submatrices
• On a problem of K. Zarankiewicz

This page was built for publication: On the Turán number of ordered forests