On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem
From MaRDI portal
Publication:2510770
DOI10.1134/S0081543811060150zbMath1296.05099arXiv1008.4707OpenAlexW1990307566MaRDI QIDQ2510770
Publication date: 4 August 2014
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.4707
Related Items (6)
A problem of Erdős and Sós on 3-graphs ⋮ On possible Turán densities ⋮ Semantic limits of dense combinatorial objects ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs ⋮ On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs
Cites Work
- Unnamed Item
- Unnamed Item
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
- Limits of dense graph sequences
- A class of constructions for Turan's (3,4)-problem
- An upper bound for the Turán number \(t_3(n,4)\)
- What we know and what we do not know about Turán numbers
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- The number of cliques in graphs of given order and size
- On Sets of Acquaintances and Strangers at any Party
- On the Minimal Density of Triangles in Graphs
- Lower bounds on the number of triangles in a graph
- Flag algebras
This page was built for publication: On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem
