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

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

B a u m g a r t n e r- A . H a j n a l, A proof (involving Martin's axiom) of a partition relation

  • Iund. Math.,
  • 1973

On the complete subgraphs of graphs defined by systems of sets

  • Acta Math. Acad. .Sci. hung.,
  • 1966

a j n a 1, On chromatic number of graphs and set-systems

  • A HP.Erdős---
  • Acta Math. Acad. Sci. Hung.,
  • 1966

p e c k e r, On a theorem in the theory of relations and a solution of a problem of Knaster

  • E SP.Erdős--
  • Coll. Math.,
  • 1961

Similar Papers

Loading similar papers…