Linear Turán numbers of acyclic triple systems
From MaRDI portal
Publication:2237863
DOI10.1016/J.EJC.2021.103435zbMATH Open1476.05080OpenAlexW3201040957MaRDI QIDQ2237863FDOQ2237863
Authors: Miklós Ruszinkó, Gábor N. Sárközy, András Gyárfás 
Publication date: 28 October 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2021.103435
Recommendations
Cites Work
- Title not available (Why is that?)
- On maximal paths and circuits of graphs
- Title not available (Why is that?)
- The history of degenerate (bipartite) extremal graph problems
- Some Theorems on Abstract Graphs
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- Title not available (Why is that?)
- Hypergraph extensions of the Erdős-Gallai theorem
- Minimal paths and cycles in set systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- Extremal Finite Set Theory
- Extremal problems for finite sets
- Turán and Ramsey numbers in linear triple systems
- An extension of Mantel's theorem to \(k\)-graphs
- Embedding hypertrees into Steiner triple systems
Cited In (5)
- Linear three-uniform hypergraphs with no Berge path of given length
- Turán and Ramsey numbers in linear triple systems. II
- The linear Turán number of small triple systems or why is the wicket interesting?
- On the Turán number of the linear \(3\)-graph \(C_{13}\)
- Crowns in linear \(3\)-graphs of minimum degree \(4\)
This page was built for publication: Linear Turán numbers of acyclic triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2237863)
