An extremal problem for sets with applications to graph theory

DOI10.1016/0097-3165(85)90048-2zbMath0578.05002WikidataQ100329026 ScholiaQ100329026MaRDI QIDQ1066141

Noga Alon

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(85)90048-2

zbMATH Keywords

saturated graphs; set partition; saturated hypergraphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05A17: Combinatorial aspects of partitions of integers

05C65: Hypergraphs

Related Items

Solution of an extremal problem for sets using resultants of polynomials, A simple proof of the upper bound theorem, Hyperconnectivity of graphs, Covering graphs by the minimum number of equivalence relations, On the kernel of intersecting families, A note on induced cycles in Kneser graphs, Asymptotic growth of sparse saturated structures is locally determined, An extremal problem for sets: A new approach via Bezoutians, Matchings and covers in hypergraphs

Cites Work

• Intersection patterns of convex sets
• A simple proof of the upper bound theorem
• Hyperconnectivity of graphs
• An extremal problem for two families of sets
• Solution of a problem of A. Ehrenfeucht and J. Mycielski
• A Problem in Graph Theory
• On generalized graphs
• On a Conjecture of Erdos, Hajnal and Moon
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item