Linear Turan numbers of r-uniform linear cycles and related Ramsey numbers

Clayton Collier-Cartaino, Nathan Graber, Tao Jiang

An $r$-uniform hypergraph is called an $r$-graph. A hypergraph is linear if every two edges intersect in at most one vertex. Given a linear $r$-graph $H$ and a positive integer $n$…