Asymptotic solution of a Turán-type problem

DOI10.1007/BF01787573MaRDI QIDQ2276984zbMATH OpenOpenAlexFDO

Authors Peter Frankl

Publication date 1990

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01787573

zbMATH Keywords

uniform hypergraphextremal hypergraphsymmetric differencemaximum number of edgesextremal set problemexcluded subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Recommendations

• scientific article; zbMATH DE number 736291
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• scientific article; zbMATH DE number 4200236
• On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
• On an extremal hypergraph problem of Brown, Erdős and Sós

Cites work

• scientific article; zbMATH DE number 3467166 (Why is no real title available?)
• scientific article; zbMATH DE number 3224335 (Why is no real title available?)
• A new generalization of the Erdős-Ko-Rado theorem
• Extremal problems whose solutions are the blowups of the small Witt- designs
• On extremal problems of graphs and generalized graphs
• Three-graphs without two triples whose symmetric difference is contained in a third
• Union-free hypergraphs and probability theory

Cited in

(22)

• scientific article; zbMATH DE number 736291 (Why is no real title available?)
• 2-cancellative hypergraphs and codes
• Counting substructures. II: Hypergraphs
• scientific article; zbMATH DE number 4008442 (Why is no real title available?)
• Co-degree density of hypergraphs
• scientific article; zbMATH DE number 4031696 (Why is no real title available?)
• scientific article; zbMATH DE number 4156486 (Why is no real title available?)
• A note on a Turán-type extremal question on 3-graphs
• Asymptotic solution of the Turán problem for some hypergraphs
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Constructions of non-principal families in extremal hypergraph theory
• A new generalization of Mantel's theorem to \(k\)-graphs
• Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
• High dimensional Hoffman bound and applications in extremal combinatorics
• Exact solution of some Turán-type problems
• On \(k\)-uniform random hypergraphs without generalized fans
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• A hypergraph extension of Turán's theorem
• An asymptotic resolution of a conjecture of Szemerédi and Petruska
• Hypergraphs with independent neighborhoods
• On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges
• Extremal Problems for Hypergraph Blowups of Trees

This page was built for publication: Asymptotic solution of a Turán-type problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276984)