Un problème de partition de l'ensemble des parties à trois éléments d'un ensemble fini

DOI10.1016/0012-365X(83)90058-4zbMath0504.05045OpenAlexW1985071503MaRDI QIDQ1835683

J. R. Tort

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90058-4

zbMATH Keywords

uniform hypergraphsKneser's conjecturepartitions into cliques

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (3)

Independence numbers of Johnson-type graphs ⋮ Chromatic number via Turán number ⋮ Decomposition of the complete hypergraph into hyperclaws

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• On the number of square classes of a field with finite stufe
• A short proof of Kneser's conjecture
• Level of a field and the number of square classes
• Sur deux invariants d'un corps de niveau fini
• Unnamed Item
• Unnamed Item

This page was built for publication: Un problème de partition de l'ensemble des parties à trois éléments d'un ensemble fini