Asymptotic solution for a new class of forbidden r-graphs
From MaRDI portal
Publication:809090
DOI10.1007/BF02124681zbMath0732.05031OpenAlexW2049090616MaRDI QIDQ809090
Publication date: 1989
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02124681
Related Items (32)
On Erdős-Sós conjecture for trees of large size ⋮ Gaps in the saturation spectrum of trees ⋮ On fan-wheel and tree-wheel Ramsey numbers ⋮ A Motzkin-Straus type result for 3-uniform hypergraphs ⋮ Symmetry in Turán sums of squares polynomials from flag algebras ⋮ RAMSEY NUMBERS FOR TREES ⋮ An Irrational Lagrangian Density of a Single Hypergraph ⋮ Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions ⋮ Maximisers of the hypergraph Lagrangian outside the principal range ⋮ The inducibility of complete bipartite graphs ⋮ An Erdős-Gallai-type theorem for keyrings ⋮ On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices ⋮ The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex ⋮ Turán-Ramsey Theorems and Kp-Independence Numbers ⋮ Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ Turán numbers of extensions ⋮ Lagrangian-perfect hypergraphs ⋮ \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles ⋮ Lagrangian densities of linear forests and Turán numbers of their extensions ⋮ Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians ⋮ GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS ⋮ The Erdős-Sós conjecture for spiders ⋮ Dense 3-uniform hypergraphs containing a large clique ⋮ A sufficient degree condition for a graph to contain all trees of size \(k\) ⋮ A variation of the Erdős-Sós conjecture in bipartite graphs ⋮ Ramsey numbers of Berge-hypergraphs and related structures ⋮ Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number ⋮ The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension ⋮ Lagrangian densities of enlargements of matchings in hypergraphs ⋮ Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions ⋮ Turán Numbers of Multiple Paths and Equibipartite Forests ⋮ An irrational Turán density via hypergraph Lagrangian densities
Cites Work
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
- Method of quadratic forms in the Turan combinatorial problem
- Hypergraphs do not jump
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Three-graphs without two triples whose symmetric difference is contained in a third
- On maximal paths and circuits of graphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
This page was built for publication: Asymptotic solution for a new class of forbidden r-graphs
