On Turán densities of small triple graphs
From MaRDI portal
Publication:896067
DOI10.1016/J.EJC.2015.09.005zbMath1327.05192OpenAlexW1793772240MaRDI QIDQ896067
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
Cites Work
- Unnamed Item
- An exact result for 3-graphs
- An upper bound for the Turán number \(t_3(n,4)\)
- On hypergraphs with every four points spanning at most two triples
- On the Turán number of triple systems
- The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- Turán problems for integer-weighted graphs
- On the density of 2-colorable 3-graphs in which any four points span at most two edges
- On Triple Systems with Independent Neighbourhoods
- A new generalization of the Erdős-Ko-Rado theorem
This page was built for publication: On Turán densities of small triple graphs
