Smallest 3-graphs having a 3-colored edge in every k-coloring

DOI10.1016/0012-365X(79)90111-0zbMath0408.05041MaRDI QIDQ1258312

F. Sterboul

Publication date: 1979

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

zbMATH Keywords

HypergraphsExtremal Problems3-GraphColorings

Mathematics Subject Classification ID

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

Related Items (1)

An anti-Ramsey theorem on cycles

Cites Work

• A problem on triples
• Un Probleme De Coloration Aux Aspects Varies
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Smallest 3-graphs having a 3-colored edge in every k-coloring