A problem of Erdős and Sós on 3-graphs
From MaRDI portal
Publication:273102
DOI10.1007/s11856-015-1267-4zbMath1334.05092arXiv1303.7372WikidataQ57601313 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
uniform hypergraph; \(r\)-uniform hypergraph; edge density; spanned subgraph; \(\delta\)-linear density
Related Items
Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs, Semidefinite Programming and Ramsey Numbers, Decomposing Graphs into Edges and Triangles, Minimum Number of Monotone Subsequences of Length 4 in Permutations, C5 ${C}_{5}$ is almost a fractalizer, 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, Embedding tetrahedra into quasirandom hypergraphs, Note on upper density of quasi-random hypergraphs, Inducibility of directed paths, Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle, The codegree threshold of \(K_4^-\), Maximizing five-cycles in \(K_r\)-free graphs, Paths of length three are \(K_{r+1}\)-Turán-good, Extremal problems in uniformly dense hypergraphs, Minimum number of edges that occur in odd cycles, Compactness and finite forcibility of graphons, Rainbow triangles in three-colored graphs, Tournaments, 4-uniform hypergraphs, and an exact extremal result, Tiling multipartite hypergraphs in quasi-random hypergraphs, On the Maximum Quartet Distance between Phylogenetic Trees
Uses Software
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
