Asymptotic solution for a new class of forbidden r-graphs
From MaRDI portal
Publication:809090
DOI10.1007/BF02124681zbMATH Open0732.05031OpenAlexW2049090616MaRDI QIDQ809090FDOQ809090
Authors: Alexander Sidorenko 
Publication date: 1989
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02124681
Recommendations
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Counting \(r\)-graphs without forbidden configurations
- On some extremal problems on \(r\)-graphs
- Excluding Induced Subgraphs III: A General Asymptotic
- scientific article; zbMATH DE number 3407723
Cites Work
- Hypergraphs do not jump
- On maximal paths and circuits of graphs
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Three-graphs without two triples whose symmetric difference is contained in a third
- Method of quadratic forms in the Turan combinatorial problem
Cited In (36)
- Ramsey numbers of Berge-hypergraphs and related structures
- The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex
- 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
- Dense 3-uniform hypergraphs containing a large clique
- The inducibility of complete bipartite graphs
- Gaps in the saturation spectrum of trees
- Lagrangian densities of linear forests and Turán numbers of their extensions
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- On fan-wheel and tree-wheel Ramsey numbers
- The Erdős-Sós conjecture for spiders
- On Erdős-Sós conjecture for trees of large size
- The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension
- Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
- Lagrangian densities of enlargements of matchings in hypergraphs
- An irrational Turán density via hypergraph Lagrangian densities
- On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- Turán-Ramsey Theorems and Kp-Independence Numbers
- An Irrational Lagrangian Density of a Single Hypergraph
- Lagrangian-perfect hypergraphs
- Turán numbers of extensions
- An asymptotically tight bound on the q-index of graphs with forbidden cycles
- Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs
- GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
- A Motzkin-Straus type result for 3-uniform hypergraphs
- Maximisers of the hypergraph Lagrangian outside the principal range
- An Erdős-Gallai-type theorem for keyrings
- \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
- Growth rates of the bipartite Erdős-Gyárfás function
- Turán Numbers of Multiple Paths and Equibipartite Forests
- Ramsey numbers for trees
- Ramsey numbers of Berge-hypergraphs and related structures
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- Symmetry in Turán sums of squares polynomials from flag algebras
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
This page was built for publication: Asymptotic solution for a new class of forbidden r-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809090)
