On Turán's \((3,4)\)-problem with forbidden subgraphs
From MaRDI portal
Publication:2341979
DOI10.1134/S000143461401026XzbMath1310.05126arXiv1210.4605MaRDI QIDQ2341979
Publication date: 8 May 2015
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.4605
Related Items
Sparse halves in dense triangle-free graphs, Symmetry in Turán sums of squares polynomials from flag algebras, Symmetric sums of squares over \(k\)-subset hypercubes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
- A class of constructions for Turan's (3,4)-problem
- An upper bound for the Turán number \(t_3(n,4)\)
- The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Flag algebras