Forbidding complete hypergraphs as traces

DOI10.1007/S00373-007-0755-7zbMath1140.05047OpenAlexW2078969454MaRDI QIDQ2478165

Yi Zhao, Dhruv Mubayi

Publication date: 14 March 2008

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

Full work available at URL: https://doi.org/10.1007/s00373-007-0755-7

zbMATH Keywords

hypergraphextremal problemTurán problemTrace

Mathematics Subject Classification ID

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

Related Items (6)

Forbidding \(K_{2,t}\) traces in triple systems ⋮ On t-Intersecting Hypergraphs with Minimum Positive Codegrees ⋮ Induced Turán problems and traces of hypergraphs ⋮ Linear algebra methods for Forbidden configurations ⋮ Ramsey numbers of Berge-hypergraphs and related structures ⋮ Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supersaturated graphs and hypergraphs
• On finite set-systems whose every intersection is a kernel of a star
• On disjointly representable sets
• On the VC-dimension of uniform hypergraphs
• Exact computation of the hypergraph Turán function for expanded complete 2-graphs
• On extremal problems of graphs and generalized graphs
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• Disjoint representability of sets and their complements
• A hypergraph extension of Turán's theorem
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

This page was built for publication: Forbidding complete hypergraphs as traces