Matchings avoiding ordered patterns
J\'anos Bar\'at, Andrea Freschi, G\'eza T\'oth

TL;DR
This paper investigates Turán-type problems in ordered graphs, determining maximum edge counts avoiding specific matchings with patterns like non-separated and non-nested, and explores related Ramsey problems and conjectures.
Contribution
It provides exact bounds for non-separated matchings and bounds for non-nested matchings, advancing understanding of pattern-avoiding structures in ordered graphs.
Findings
Exact maximum edges for non-separated matchings: (3/2)(k-1)n + Θ(k^2)
Bounds for non-nested matchings: between (k-1)n and (k-1)n + C(k-1, 2)
Results imply new bounds for related Ramsey-type problems
Abstract
A {\it vertex-ordered} graph is a graph equipped with a linear ordering of its vertices. A pair of independent edges in an ordered graph can exhibit one of the following three patterns: separated, nested or crossing. We say a pair of independent edges is non-separated if it is either crossing or nested. Non-nested and non-crossing pairs are defined analogously. We are interested in the following Tur\'an-type problems: for each of the aforementioned six patterns, determine the maximum number of edges of an -vertex ordered graph that does not contain a -matching such that every pair of edges exhibit the fixed pattern. Exact answers have already been obtained for four of the six cases. The main objective of this paper is to investigate the two remaining open cases, namely non-separated and non-nested matchings. We determine the exact maximum number of edges of an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Computational Geometry and Mesh Generation · Advanced Graph Theory Research
