Tight bounds for intersection-reverse sequences, edge-ordered graphs, and applications

DOI10.1112/JLMS.70324MaRDI QIDQ6897951zbMATH OpenFDO

Authors Barnabás Janzer, Oliver Janzer, Abhishek Methuku, Gábor Tardos

Publication date 19 November 2025

Published in Journal of the London Mathematical Society. Second Series (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1112/JLMS.70324

zbMATH Keywords

extremal problems for geometric graphsextremal problems for topological graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35)

Cites work

• A characterization of edge-ordered graphs with almost linear extremal functions
• A combinatorial problem in geometry.
• A Dual of Dilworth's Decomposition Theorem
• A semi-algebraic version of Zarankiewicz's problem
• Construction of locally plane graphs with many edges
• Cutting circles into pseudo-segments and improved bounds for incidences
• Forbidden paths and cycles in ordered graphs and matrices
• Geometric graphs with no self-intersecting path of length three
• How to cut pseudoparabolas into segments
• scientific article; zbMATH DE number 3643294 (Why is no real title available?)
• scientific article; zbMATH DE number 1342089 (Why is no real title available?)
• scientific article; zbMATH DE number 2145243 (Why is no real title available?)
• scientific article; zbMATH DE number 3333193 (Why is no real title available?)
• Intersection reverse sequences and geometric applications.
• Lenses in arrangements of pseudo-circles and their applications
• On a problem of K. Zarankiewicz
• On geometric graphs with no k pairwise parallel edges
• On the maximum number of edges in quasi-planar graphs
• On the maximum number of edges in topological graphs with no four pairwise crossing edges
• On the Turán number of ordered forests
• Quasi-planar graphs have a linear number of edges
• Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
• Some Combinatorial Theorems on Monotonicity
• String graphs have the Erdős-Hajnal property
• Tangencies between families of disjoint regions in the plane
• The beginnings of geometric graph theory
• The history of degenerate (bipartite) extremal graph problems
• The number of tangencies between two families of curves
• Turán numbers of subdivided graphs
• Turán problems for edge-ordered graphs

This page was built for publication: Tight bounds for intersection-reverse sequences, edge-ordered graphs, and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897951)