Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
From MaRDI portal
Publication:4635508
DOI10.1017/S0963548317000530zbMath1390.05149arXiv1404.5015OpenAlexW2181694489MaRDI QIDQ4635508
Clayton Collier-Cartaino, Nathan Graber, Tao Jiang
Publication date: 23 April 2018
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.5015
Related Items (20)
The exact linear Turán number of the sail ⋮ Turán numbers for hypergraph star forests ⋮ Multicolor Turán numbers ⋮ Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$ ⋮ The linear Turán number of small triple systems or why is the wicket interesting? ⋮ On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) ⋮ Linear cycles of consecutive lengths ⋮ On Tight Cycles in Hypergraphs ⋮ Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs ⋮ A linear hypergraph extension of the bipartite Turán problem ⋮ Linear Turán numbers of acyclic triple systems ⋮ On 3-uniform hypergraphs without a cycle of a given length ⋮ Cycles of given lengths in hypergraphs ⋮ Linear saturation numbers of Berge-\(C_3\) and Berge-\(C_4\) ⋮ Spectral extremal results for hypergraphs ⋮ Supersaturation of even linear cycles in linear hypergraphs ⋮ The Ramsey number of 3-uniform loose path versus star ⋮ Asymptotic Turán number for linear 5-cycle in 3-uniform linear hypergraphs ⋮ Ramsey Numbers for Nontrivial Berge Cycles ⋮ A linear hypergraph extension of Turán's theorem
Cites Work
- Unnamed Item
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- 3-uniform hypergraphs avoiding a given odd cycle
- Turán problems and shadows. I: Paths and cycles
- The early evolution of the \(H\)-free process
- On a class of degenerate extremal graph problems
- A note on Ramsey numbers
- On hypergraphs of girth five
- Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
- Coloring graphs with sparse neighborhoods
- The independence number of graphs with a forbidden cycle and Ramsey numbers
- Cycles of even length in graphs
- On the number of edges of quadrilateral-free graphs
- Rainbow Turán problem for even cycles
- Hypergraph Ramsey numbers: triangles versus cliques
- Hypergraph Turán numbers of linear cycles
- On the Turán number for the hexagon
- On the existence of triangulated spheres in 3-graphs, and related problems
- On Arithmetic Progressions of Cycle Lengths in Graphs
- A note on the Turán function of even cycles
- Hypergraphs with No Cycle of a Given Length
- Intersection Theorems for Systems of Sets
- Rainbow Turán Problems
- On cycle—Complete graph ramsey numbers
- Solving a linear equation in a set of integers I
- Independence numbers of locally sparse graphs and a Ramsey type problem
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Turán Numbers of Subdivided Graphs
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Dynamic concentration of the triangle-free process
- On a Problem of Heilbronn
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On the structure of linear graphs
- Graph colouring and the probabilistic method
- A note on odd cycle-complete graph Ramsey numbers
This page was built for publication: Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
