Canonical Ramsey numbers for partite hypergraphs
Mat\'ias Az\'ocar Carvajal, Giovanne Santos, Mathias Schacht
TL;DR
This paper proves that canonical Ramsey numbers for fixed-uniformity partite hypergraphs grow at a single exponential rate, advancing understanding of their combinatorial growth patterns.
Contribution
It establishes the exponential growth rate of canonical Ramsey numbers specifically for partite hypergraphs of fixed uniformity.
Findings
Canonical Ramsey numbers grow single exponentially for fixed uniformity.
The result applies to all fixed uniformities in partite hypergraphs.
Provides a new understanding of the growth behavior of these numbers.
Abstract
We show that canonical Ramsey numbers for partite hypergraphs grow single exponentially for any fixed uniformity.
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 · Computability, Logic, AI Algorithms