Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
From MaRDI portal
(Redirected from Publication:4635508)
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, Mubayi, and Verstra"ete. For even cycles, our result extends the result of Bondy and Simonovits on the Tur'an numbers of even cycles to linear hypergraphs. Using our results on linear Tur'an numbers we also obtain bounds on the cycle-complete hypergraph Ramsey numbers. We show that there are positive constants and , depending only on and , such that and .
Recommendations
- Hypergraph Turán numbers of linear cycles
- Turán and Ramsey numbers in linear triple systems
- Cycle-complete Ramsey numbers
- Linear Ramsey numbers
- On some Ramsey and Turán-type numbers for paths and cycles
- On graphs with linear Ramsey numbers
- The Cycle-Complete Graph Ramsey Numbers
- Turán and Ramsey numbers in linear triple systems. II
- Ramsey numbers of a cycle
- Ramsey numbers for line graphs and perfect graphs
Cites work
- 3-uniform hypergraphs avoiding a given odd cycle
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- A note on odd cycle-complete graph Ramsey numbers
- A note on Ramsey numbers
- A note on the Turán function of even cycles
- Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
- Coloring graphs with sparse neighborhoods
- Cycles of even length in graphs
- Dynamic concentration of the triangle-free process
- Exact solution of the hypergraph Turán problem for k-uniform linear paths
- Graph colouring and the probabilistic method
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- Hypergraph Ramsey numbers: triangles versus cliques
- Hypergraph Turán numbers of linear cycles
- Hypergraphs with no cycle of a given length
- Independence numbers of locally sparse graphs and a Ramsey type problem
- Intersection Theorems for Systems of Sets
- On a class of degenerate extremal graph problems
- On a Problem of Heilbronn
- On arithmetic progressions of cycle lengths in graphs
- On cycle—Complete graph ramsey numbers
- On hypergraphs of girth five
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On the existence of triangulated spheres in 3-graphs, and related problems
- On the number of edges of quadrilateral-free graphs
- On the structure of linear graphs
- On the Turán number for the hexagon
- Rainbow Turán problem for even cycles
- Rainbow Turán Problems
- Solving a linear equation in a set of integers I
- The early evolution of the \(H\)-free process
- The history of degenerate (bipartite) extremal graph problems
- The independence number of graphs with a forbidden cycle and Ramsey numbers
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Turán numbers of subdivided graphs
- Turán problems and shadows. I: Paths and cycles
Cited in
(33)- On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
- Cycles of given lengths in hypergraphs
- Spectral extremal results for hypergraphs
- The Ramsey number of 3-uniform loose path versus star
- Asymptotic Turán number for linear 5-cycle in 3-uniform linear hypergraphs
- Turán and Ramsey numbers in linear triple systems. II
- A linear hypergraph extension of Turán's theorem
- The exact linear Turán number of the sail
- Turán numbers for hypergraph star forests
- Multicolor Turán numbers
- The linear Turán number of small triple systems or why is the wicket interesting?
- A linear hypergraph extension of the bipartite Turán problem
- Linear Turán numbers of acyclic triple systems
- Hypergraph Turán numbers of linear cycles
- On tight cycles in hypergraphs
- Supersaturation of even linear cycles in linear hypergraphs
- Ramsey numbers for nontrivial Berge cycles
- A Ramsey variant of the Brown-Erdős-Sós conjecture
- Spectral radius on linear \(r\)-graphs without expanded \(K_{r+1}\)
- On the number of linear hypergraphs of large girth
- On 3-uniform hypergraphs without a cycle of a given length
- Linear cycles of consecutive lengths
- Turán theorems for even cycles in random hypergraph
- Linear saturation numbers of Berge-C₃ and Berge-C₄
- Sidorenko hypergraphs and random Turán numbers
- Linear Turán problems with bounded matching number in hypergraphs
- Many pentagons in triple systems
- Turán problems for star-path forests in hypergraphs
- Supersaturation of odd linear cycles
- Avoiding range via Turán-type bounds
- Bounds on linear Turán number for trees
- Bounds on the spectral radii of Berge C₅-free linear r-graphs
This page was built for publication: Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635508)