A structural result for 3-graphs

DOI10.1016/j.disc.2016.09.036zbMath1357.05108OpenAlexW2550780854MaRDI QIDQ512589

Peter Frankl

Publication date: 27 February 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.09.036

zbMATH Keywords

hypergraphsextremal problemsforbidden configurations

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)

Related Items

Structural results for conditionally intersecting families and some applications

Cites Work

• Unnamed Item
• Set systems with union and intersection constraints
• On Sperner families satisfying an additional condition
• Erdős--Ko--Rado for three sets
• An intersection theorem for four sets
• On generalized graphs
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: A structural result for 3-graphs