Forbidden paths and cycles in ordered graphs and matrices

2006/12/01 by János Pach, Gábor Tardos · 22 citations
Mathematics · Engineering · Computer Science · #Graph theory and applications #graph theory and CDMA systems #Advanced Graph Theory Research

paper · doi:10.1007/bf02773960

Cited by

• Simplex volumes in hyperplane arrangements
• Matchings avoiding ordered patterns
• On Computational Aspects of Cores of Ordered Graphs
• Complexity Aspects of Homomorphisms of Ordered Graphs
• On Computational Aspects of Ordered Matching Problems
• Relative Turán densities for ordered graphs: all and nothing
• Shadows of ordered graphs
• Algorithms for Pattern Containment in 0-1 Matrices
• Continuous Tur'an numbers
• Equal Entries in Totally Positive Matrices
• Turán problems for Edge-ordered graphs
• On Relative Ordered Turán Density
• Erdős's unit distance problem and rigidity
• Extremal problems for convex geometric hypergraphs and ordered\n hypergraphs
• Extremal problems in ordered graphs
• Extremal problems on ordered and convex geometric hypergraphs
• Binary smoothing and relative Turan densities of ordered triangle-tails
• Partitioning ordered hypergraphs
• Improved lower bounds on extremal functions of multidimensional permutation matrices
• Ordered Ramsey numbers
• Interval minors of complete multipartite graphs
• Tight bounds on the maximum size of a set of permutations with bounded VC-dimension