The maximum number of edges in a 3-graph not containing a given star

DOI10.1007/BF01788535zbMath0633.05051MaRDI QIDQ1095933

Peter Frankl, Fan R. K. Chung

Publication date: 1987

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

zbMATH Keywords

3-subsetsk-star

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items

Exact solution of some Turán-type problems, The maximum number of triangles in \(F_k\)-free graphs, Unavoidable hypergraphs, Linear trees in uniform hypergraphs

Cites Work

• Unnamed Item
• On unavoidable graphs
• An extremal set theoretical characterization of some Steiner systems
• Unavoidable stars in 3-graphs
• Forbidding just one intersection
• Exact solution of some Turán-type problems
• On the combinatorial problems which I would most like to see solved
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• An extremal problem for 3-graphs
• On unavoidable hypergraphs