scientific article; zbMATH DE number 3896979

MaRDI QIDQ3676175zbMATH OpenFDO

Authors Shinsei Tazawa, Teruhiro Shirakura

Publication date 1983

zbMATH Keywords

clique-freehypergraphk-cliqueTurán's problem

Mathematics Subject Classification ID

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

Recommendations

• On the maximum number of edges in hypergraphs with fixed matching and clique number
• Many Cliques in Bounded-Degree Hypergraphs
• On the maximal clique problem
• scientific article; zbMATH DE number 4057513
• More on maximal intersecting families of finite sets

Cited in

(12)

• An upper bound for the Turán number \(t_3(n,4)\)
• Maximum \(\mathcal{H}\)-free subgraphs
• The Szemerédi-Petruska conjecture for a few small values
• Family sizes for complete multipartite graphs
• scientific article; zbMATH DE number 3634258 (Why is no real title available?)
• Solution to a problem of Katona on counting cliques of weighted graphs
• Many Cliques in Bounded-Degree Hypergraphs
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters
• Some results and problems on clique coverings of hypergraphs
• A note on the minimum size of Turán systems
• The de Bruijn-Erdős theorem for hypergraphs
• Constructions of Turán systems that are tight up to a multiplicative constant

This page was built for publication:

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