Some Results in Aczel-Feferman Logic and Set Theory

Some extremal results in cochromatic and

Some extremal results in cochromatic and dichromatic theory

✍ Paul Erdös; John Gimbel; Dieter Kratsch 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB

## Abstract For a graph __G__, the cochromatic number of __G__, denoted __z__(__G__), is the least __m__ for which there is a partition of the vertex set of __G__ having order __m__. where each part induces a complete or empty graph. We show that if {__G__~__n__~} is a family of graphs where __G__

Some Results in Aczel-Feferman Logic and Set Theory

✦ Synopsis