Asymptotic solution for a new class of forbidden r-graphs
From MaRDI portal
Publication:809090
DOI10.1007/BF02124681zbMath0732.05031MaRDI QIDQ809090
Publication date: 1989
Published in: Combinatorica (Search for Journal in Brave)
Related Items
The inducibility of complete bipartite graphs, Turán-Ramsey Theorems and Kp-Independence Numbers, The Erdős-Sós conjecture for spiders
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