Linear Turán numbers of acyclic triple systems
From MaRDI portal
Publication:2237863
Recommendations
Cites work
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 4200236 (Why is no real title available?)
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 1314686 (Why is no real title available?)
- scientific article; zbMATH DE number 3258067 (Why is no real title available?)
- An extension of Mantel's theorem to \(k\)-graphs
- Embedding hypertrees into Steiner triple systems
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- Extremal Finite Set Theory
- Extremal problems for finite sets
- Hypergraph extensions of the Erdős-Gallai theorem
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- Minimal paths and cycles in set systems
- On maximal paths and circuits of graphs
- Some Theorems on Abstract Graphs
- The history of degenerate (bipartite) extremal graph problems
- Turán and Ramsey numbers in linear triple systems
Cited in
(7)- Crowns in linear \(3\)-graphs of minimum degree \(4\)
- The exact linear Turán number of the sail
- Turán number of special four cycles in triple systems
- 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}\)
- Linear three-uniform hypergraphs with no Berge path of given length
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)
