Linear Turan numbers of r-uniform linear cycles and related Ramsey numbers
Clayton Collier-Cartaino, Nathan Graber, and Tao Jiang

TL;DR
This paper establishes upper bounds on the linear Turán numbers for r-uniform linear cycles of even and odd lengths, extending classical results and deriving new bounds for related hypergraph Ramsey numbers.
Contribution
It provides the first bounds on linear Turán numbers for r-uniform cycles of all lengths, extending known results for even cycles to linear hypergraphs and linking these to hypergraph Ramsey numbers.
Findings
Bounded linear Turán numbers for even cycles in r-uniform hypergraphs.
Extended classical Turán results to linear hypergraph cycles.
Derived bounds on cycle-complete hypergraph Ramsey numbers.
Abstract
An -uniform hypergraph is called an -graph. A hypergraph is linear if every two edges intersect in at most one vertex. Given a linear -graph and a positive integer , the linear Tur\'an number is the maximum number of edges in a linear -graph that does not contain as a subgraph. For each , let denote the -uniform linear cycle of length , which is an -graph with edges such that , , and for all other pairs . For all and , we show that there exist positive constants and , depending only and , such that and . This answers a question of Kostochka,…
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 · Graph Labeling and Dimension Problems · Analytic Number Theory Research
