Extremal problems concerning transformations of the set of edges of the complete graph

DOI10.1016/S0195-6698(86)80034-8zbMath0613.05030MaRDI QIDQ1088678

Yair Caro, Noga Alon

Publication date: 1986

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

chromatic numbercolouring graphscolouring hypergraphsfamily of n-subsets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (4)

Short proofs of some extremal results. II. ⋮ Some notes on the Erdős-Szekeres theorem ⋮ Sub-Ramsey numbers of arithmetic progressions ⋮ Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples

Cites Work

• On the structure of linear graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal problems concerning transformations of the set of edges of the complete graph