A short proof of the existence of highly chromatic hypergraphs without short cycles
- 1 October 1979
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 27 (2) , 225-227
- https://doi.org/10.1016/0095-8956(79)90084-4
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Partitions of finite relational and set systemsJournal of Combinatorial Theory, Series A, 1977
- On chromatic number of finite set-systemsActa Mathematica Hungarica, 1968
- On chromatic number of graphs and set-systemsActa Mathematica Hungarica, 1966
- Graph Theory and ProbabilityCanadian Journal of Mathematics, 1959