On unavoidable graphs
How many edges can be in a graph which is forced to be contained in every graph onn vertices ande edges? In this paper we obtain bounds which are in many cases asymptotically best possible.
AMS subject classification (1980)05 C 35
Unable to display preview. Download preview PDF.
- F. R. K. Chung, R. L. Graham andN. Pippenger, On graphs which contain all small trees II,Colloquia Math. Soc. János Bolyai, Keszthely, Hungary (1976), 213–223.Google Scholar
- F. R. K. Chung, R. L. Graham andD. Coppersmith, On trees which contain all small trees,The Theory and Applications of Graphs (ed. G. Chartrand) John Wiley and Sons, 1981, 265–272.Google Scholar
- P. Erdős andJ. Spencer,Probabilistic Methods in Combinatorics, Akadémiai Kiadó, Budapest, 1974.Google Scholar