A problem of Erdős and Sós on 3-graphs

DOI10.1007/s11856-015-1267-4zbMath1334.05092arXiv1303.7372OpenAlexW1488705378WikidataQ57601313 ScholiaQ57601313MaRDI QIDQ273102

Jan Volec, Daniel Král', Roman Glebov

Publication date: 21 April 2016

Published in: Israel Journal of Mathematics, The Seventh European Conference on Combinatorics, Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.7372

zbMATH Keywords

uniform hypergraph\(r\)-uniform hypergraphedge densityspanned subgraph\(\delta\)-linear density

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Density (toughness, etc.) (05C42)

Related Items (23)

Paths of length three are \(K_{r+1}\)-Turán-good ⋮ Embedding tetrahedra into quasirandom hypergraphs ⋮ Rainbow triangles in three-colored graphs ⋮ Tournaments, 4-uniform hypergraphs, and an exact extremal result ⋮ Note on upper density of quasi-random hypergraphs ⋮ C5 ${C}_{5}$ is almost a fractalizer ⋮ Extremal problems in uniformly dense hypergraphs ⋮ The codegree threshold of \(K_4^-\) ⋮ Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle ⋮ Uniform Turán density of cycles ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Restricted problems in extremal combinatorics ⋮ On the limit of the positive \(\ell\)-degree Turán problem ⋮ Minimum Number of Monotone Subsequences of Length 4 in Permutations ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ Semidefinite Programming and Ramsey Numbers ⋮ On the Maximum Quartet Distance between Phylogenetic Trees ⋮ Maximizing five-cycles in \(K_r\)-free graphs ⋮ Decomposing Graphs into Edges and Triangles ⋮ Minimum number of edges that occur in odd cycles ⋮ Compactness and finite forcibility of graphons ⋮ Inducibility of directed paths ⋮ Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs

Uses Software

• CSDP
• SageMath
• Flagmatic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on upper density of quasi-random hypergraphs
• New Turán densities for 3-graphs
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Turán \(H\)-densities for 3-graphs
• A measure-theoretic approach to the theory of dense hypergraphs
• The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
• An exact result for 3-graphs
• Limits of dense graph sequences
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• On universality of graphs with uniformly distributed edges
• Some Ramsey-Turán type results for hypergraphs
• Mathematics of Ramsey theory. Collected papers of the Prague symposium on graph theory held in Prague, Czechoslovakia
• The codegree threshold of \(K_4^-\)
• On Ramsey - Turan type theorems for hypergraphs
• On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Hypergraphs Do Jump
• CSDP, A C library for semidefinite programming
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
• Flag algebras
• An extremal graph problem
• On the structure of linear graphs
• Ramsey-Turán theory

This page was built for publication: A problem of Erdős and Sós on 3-graphs