Ordered Ramsey and Tur\'an numbers of alternating paths and their variants
Gaurav Kucheriya, Allan Lo, Jan Petr, Amedeo Sgueglia, Jun Yan

TL;DR
This paper investigates ordered Ramsey and Turán numbers for alternating paths, establishing bounds and exact values, and explores related ordered paths to understand their combinatorial properties.
Contribution
It provides new bounds for the ordered Ramsey number of alternating paths and determines their exact ordered Turán number, advancing understanding of ordered graph extremal problems.
Findings
Proved that R_<(AP_n) ≤ (2 + √2/2 + o(1))n.
Determined the exact ordered Turán number of AP_n.
Studied the ordered Ramsey and Turán numbers of related ordered paths.
Abstract
An ordered graph is a graph whose vertex set is equipped with a total order. The ordered complete graph is the complete graph with vertex set equipped with the natural ordering of the integers. Given an ordered graph , the ordered Ramsey number is the smallest integer such that every red/blue edge-colouring of contains a monochromatic copy of with vertices appearing in the same relative order as in . Balko, Cibulka, Kr\'al, and Kyn\v{c}l asked whether, among all ordered paths on vertices, the ordered Ramsey number is minimised by the alternating path -- the ordered path with vertex set such that the vertices encountered along the path are . Motivated by this problem, we make progress on establishing the value of by proving that \[ R_{<}(\mathrm{AP}_n)\leq…
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 · Advanced Graph Theory Research · Advanced Topology and Set Theory
