Colorations Extrêmes Dans Les Hypergraphes

DOI10.1016/S0304-0208(08)73439-XzbMATH Open0534.05049MaRDI QIDQ3317147FDOQ3317147

Authors: F. Sterboul, D. Wertheimer 

Publication date: 1983

Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 568840
• Color critical hypergraphs with many edges
• Coloring uniform hypergraphs with few colors
• Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
• Extremal problems for panchromatic colourings of uniform hypergraphs

zbMATH Keywords

uniform hypergraphextreme coloration

Mathematics Subject Classification ID

Hypergraphs (05C65)

Cited In (10)

• Hypergraphs with many Kneser colorings
• Title not available (Why is that?)
• Hypergraph coverings and local colorings
• Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
• Edge coloring complete uniform hypergraphs with many components
• Exact results on the number of restricted edge colorings for some families of linear hypergraphs
• Colorations généralisées, graphes biorientés et deux ou trois choses sur François. (Generalized colourings, digraphs and some things concerning François)
• A class of Ramsey-extremal hypergraphs
• On Some Extremal Properties of Hypergraph Colorings
• To an extremal problem on chromatic numbers of finite graphs

This page was built for publication: Colorations Extrêmes Dans Les Hypergraphes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3317147)