Turán problems for edge-ordered graphs
From MaRDI portal
Publication:2692781
DOI10.1016/j.jctb.2022.12.006OpenAlexW4313593699MaRDI QIDQ2692781
Abhishek Methuku, Gábor Tardos, Dániel Gerbner, Máté Vizer, Dániel T. Nagy, Dömötör Pálvölgyi
Publication date: 23 March 2023
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.00849
discrete geometryextremal combinatoricsTurán's theoremforbidden submatricesErdős-Stone-Simonovits theoremedge ordered graphs
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Enumeration in graph theory (05C30) Ordered sets (06A99)
Related Items
Saturation of Ordered Graphs ⋮ On the number of tangencies among 1-intersecting \(x\)-monotone curves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Increasing paths in edge-ordered graphs: the hypercube and random graph
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- Tangencies between families of disjoint regions in the plane
- On unit distances in a convex polygon
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Constructions of non-principal families in extremal hypergraph theory
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- A lower bound on the number of unit distances between the vertices of a convex polygon
- Davenport-Schinzel theory of matrices
- Generalized Davenport-Schinzel sequences with linear upper bound
- Statistics of orderings
- Forbidden subposet problems for traces of set families
- Lexicographic Ramsey theory
- The maximum number of unit distances in a convex \(n\)-gon
- The Turán density of triple systems is not principal
- Edge-ordered Ramsey numbers
- Nearly-linear monotone paths in edge-ordered graphs
- Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs
- Monotone paths in dense edge-ordered graphs
- Forbidden paths and cycles in ordered graphs and matrices
- Intersection reverse sequences and geometric applications.
- Increasing paths in edge ordered graphs
- Bipartite Turán problems for ordered graphs
- Increasing Hamiltonian paths in random edge orderings
- Construction of Locally Plane Graphs with Many Edges
- On edge‐ordered Ramsey numbers
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Some Combinatorial Theorems on Monotonicity
- On the structure of linear graphs
- On the Turán number of ordered forests
- The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\)
- On quantitative aspects of a canonisation theorem for edge‐orderings
