Turán problems for edge-ordered graphs
From MaRDI portal
Recommendations
Cites work
- A lower bound on the number of unit distances between the vertices of a convex polygon
- Bipartite Turán problems for ordered graphs
- Construction of locally plane graphs with many edges
- Constructions of non-principal families in extremal hypergraph theory
- Davenport-Schinzel theory of matrices
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- Edge-ordered Ramsey numbers
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Forbidden paths and cycles in ordered graphs and matrices
- Forbidden subposet problems for traces of set families
- Generalized Davenport-Schinzel sequences with linear upper bound
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 427792 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- scientific article; zbMATH DE number 2209719 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Increasing Hamiltonian paths in random edge orderings
- Increasing paths in edge ordered graphs
- Increasing paths in edge-ordered graphs: the hypercube and random graph
- Intersection reverse sequences and geometric applications.
- Lexicographic Ramsey theory
- Monotone paths in dense edge-ordered graphs
- Nearly-linear monotone paths in edge-ordered graphs
- Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- On edge-ordered Ramsey numbers
- On quantitative aspects of a canonisation theorem for edge‐orderings
- On the structure of linear graphs
- On the Turán number of ordered forests
- On unit distances in a convex polygon
- Some Combinatorial Theorems on Monotonicity
- Statistics of orderings
- Tangencies between families of disjoint regions in the plane
- The history of degenerate (bipartite) extremal graph problems
- The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\)
- The maximum number of unit distances in a convex n-gon
- The Turán density of triple systems is not principal
Cited in
(17)- On the Turán number of some ordered even cycles
- Tilings in vertex ordered graphs
- Turán problems for integer-weighted graphs
- On the Turán number of ordered forests
- On the Turán number of ordered forests
- Saturation of Ordered Graphs
- On the number of tangencies among 1-intersecting \(x\)-monotone curves
- Tur\'an problems for Edge-ordered graphs
- Tiling edge-ordered graphs with monotone paths and other structures
- Edge ordered Turán problems
- Turán problems for oriented graphs
- On Turán-type problems and the abstract chromatic number
- Tight bounds for intersection-reverse sequences, edge-ordered graphs, and applications
- On edge-ordered graphs with linear extremal functions (extended abstract)
- Tiling problems in edge-ordered graphs (extended abstract)
- On the number of tangencies among 1-intersecting curves (extended abstract)
- Saturation of edge-ordered graphs
This page was built for publication: Turán problems for edge-ordered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692781)
