Oriented Ramsey numbers of graded digraphs
Patryk Morawski, Yuval Wigderson

TL;DR
This paper establishes that graded digraphs with bounded maximum degree have linear upper bounds on their oriented Ramsey numbers, and demonstrates the near-optimality of these bounds through matching lower bounds.
Contribution
It proves a linear upper bound on the oriented Ramsey number for graded digraphs with bounded degree and shows this bound is essentially tight.
Findings
Oriented grids in fixed dimensions have linear Ramsey numbers.
Polynomial bounds are established for hypercube Ramsey numbers.
The bounds are shown to be nearly optimal with matching lower bounds.
Abstract
We show that any graded digraph on vertices with maximum degree has an oriented Ramsey number of at most for some absolute constant , improving upon a recent result of Fox, He, and Wigderson. In particular, this implies that oriented grids in any fixed dimension have linear oriented Ramsey numbers, and gives a polynomial bound on the oriented Ramsey number of the hypercube. We also show that this result is essentially best possible, in that there exist graded digraphs on vertices with maximum degree such that their oriented Ramsey number is at least for some absolute constant .
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
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
