On Turán densities of small triple graphs
From MaRDI portal
Publication:896067
DOI10.1016/J.EJC.2015.09.005zbMATH Open1327.05192OpenAlexW1793772240MaRDI QIDQ896067FDOQ896067
Authors: Lingsheng Shi 
Publication date: 11 December 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2015.09.005
Recommendations
Cites Work
- On 3-hypergraphs with forbidden 4-vertex configurations
- Title not available (Why is that?)
- Turán problems for integer-weighted graphs
- An exact result for 3-graphs
- A new generalization of the Erdős-Ko-Rado theorem
- An upper bound for the Turán number \(t_3(n,4)\)
- On Triple Systems with Independent Neighbourhoods
- On hypergraphs with every four points spanning at most two triples
- The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
- On the Turán number of triple systems
- On the density of 2-colorable 3-graphs in which any four points span at most two edges
Cited In (15)
- Turán number of special four cycles in triple systems
- Small dense subgraphs of a graph
- New Turán densities for 3-graphs
- Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles
- Turán \(H\)-densities for 3-graphs
- On the density of trigraph homomorphisms
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^-_4\)
- Title not available (Why is that?)
- On the Turán density of uniform hypergraphs
- The Turán density of triple systems is not principal
- The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
- On Turán numbers of the complete 4-graphs
- \({\ell}\)-degree Turán density
- Turán number of generalized triangles
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
This page was built for publication: On Turán densities of small triple graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896067)
