Highly Influenced

# On complete subgraphs of r-chromatic graphs

@article{Bollobs1975OnCS, title={On complete subgraphs of r-chromatic graphs}, author={B{\'e}la Bollob{\'a}s and Paul Erd{\"o}s and Endre Szemer{\'e}di}, journal={Discrete Mathematics}, year={1975}, volume={13}, pages={97-107} }

- Published 1975 in Discrete Mathematics
DOI:10.1016/0012-365X(75)90011-4

Let G,J n) be an r-chromatic graph with n vertices in each colour class . Suppose G = G 3 (n), and t (G) . the minimal degree in G, is at least n + t (t _> 1) . We prove that C contains at least t 3 triangles but does not have to contain more titan 4t 3 of them . Furthermore, we give lower bounds for s such that G contains a complete 3-partite graph with s vertices in each class . Let';.(ii) = max t6(G) : G = G i (n), G does not contain a complete graph with r vertices ; . We obtain various… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

16 Citations

4 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-4 of 4 references