On Set-systems Having Large Chromatic Number and Not Containing Prescribed Subsystems

@inproceedings{Erds1973OnSH,
title={On Set-systems Having Large Chromatic Number and Not Containing Prescribed Subsystems},
author={Paul Erdős},
year={1973}
}

§0. Introduction § 1 . Notation §2. A theorem restricting the chromatic number of relatively small n-tuple systems §3. Corollaries to Theorem 2 .1 . The lower estimates for h 3(t, a),g3 (t, a),g n (t, a) §4. A general theorem for set systems §5 . Some consequences of Martin's axiom §6. The concept of simultaneous chromatic number. A problem. A result in L . §7. Simple properties of P( .91 , X, k), P*(So, A, k, r) . Preliminary lemmas . §8. Graph constructions §9. Graph constructions . Splitting… CONTINUE READING