### 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_{n} has o(n^{2} log^{2}(n)) edges, then z(G_{n}) = o(n). We turn our attention to dichromatic numbers. Given a digraph D, the dichromatic number of D is the minimum number of parts the vertex set of D must be partitioned into so that each part induces an acyclic digraph. Given an (undirected) graph G, the dichromatic number of G, denoted d(G), is the maximum dichromatic number of all orientations of G. Let m be an integer; by d(m) we mean the minimum size of all graphs G where d(G) = m. We show that d(m) = θ(m^{2} ln^{2}(m)).

Original language | English |
---|---|

Pages (from-to) | 579-585 |

Number of pages | 7 |

Journal | Journal of Graph Theory |

Volume | 15 |

Issue number | 6 |

DOIs | |

Publication status | Published - 1991 |

### ASJC Scopus subject areas

- Geometry and Topology

## Fingerprint Dive into the research topics of 'Some extremal results in cochromatic and dichromatic theory'. Together they form a unique fingerprint.

## Cite this

*Journal of Graph Theory*,

*15*(6), 579-585. https://doi.org/10.1002/jgt.3190150604