## Ramsey numbers in multi-colors

- F.R.K. Chung
- Dissertation, University of Pennsylvania,
- 1974

@article{Graham1980OnTC, title={On the coverings of graphs}, author={Fan Chung Graham}, journal={Discrete Mathematics}, year={1980}, volume={30}, pages={89-93} }

- Published 1980 in Discrete Mathematics
DOI:10.1016/0012-365X(80)90109-0

Suppose G is a connected graph’ with vertex set V(G) and edge set E(G). A covering of G is a family of subgraphs, say G1, Gz, . . . , G,, having the property that each edge of G is contained in at least one graph Gi, for some i. If all Gi, 1 s i 6 t, belong to a specified class of graphs H, such a covering is called an Hcovering of G. If we require all… CONTINUE READING

### Presentations referencing similar topics