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

DOI10.1016/0012-365X(83)90058-4MaRDI QIDQ1835683zbMATH OpenOpenAlexFDO

Authors 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

Kneser's conjecturepartitions into cliquesuniform hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65)

Cites work

• A short proof of Kneser's conjecture
• scientific article; zbMATH DE number 3672329 (Why is no real title available?)
• scientific article; zbMATH DE number 3531440 (Why is no real title available?)
• Kneser's conjecture, chromatic number, and homotopy
• Level of a field and the number of square classes
• On the number of square classes of a field with finite stufe
• Sur deux invariants d'un corps de niveau fini

Cited in

(3)

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

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

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