Nombres de coloration de l'hypergraphe h-parti complet

DOI10.1007/BF02414141zbMath0306.05135OpenAlexW4244731647MaRDI QIDQ1217815

Claude Berge

Publication date: 1975

Published in: Annali di Matematica Pura ed Applicata. Serie Quarta (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02414141

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Other designs, configurations (05B30) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items

Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs ⋮ The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs ⋮ Hamilton saturated hypergraphs of essentially minimum size ⋮ The edge-coloring-property for Steiner triple systems ⋮ A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations ⋮ On conjectures of Berge and Chvátal ⋮ Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs

Cites Work

• A theorem on families of sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Unnamed Item
• Unnamed Item
• Unnamed Item