×

zbMATH — the first resource for mathematics

On classes of graphs determined by forbidden subgraphs. (English) Zbl 0525.05054
MSC:
05C99 Graph theory
05C35 Extremal problems in graph theory
PDF BibTeX XML Cite
Full Text: EuDML
References:
[1] P. Erdös J. Spencer: Probabilistic Methods in Combinatorics. Akademiai Kiadó, Budapest 1974. · Zbl 0308.05001
[2] D. L. Greenwell R. L. Hemminger, J.Kleitman: Forbidden Subgraphs. Proc. 4-th S-E Conf. Graph Th. and Computing, Florida Atlantic University (1973), 389-394. · Zbl 0312.05128
[3] M. Hall, Jr.: Combinatorial Theory. Blaisdell Publ. Comp., Waltham (Massachusetts), Toronto, London 1967. · Zbl 0196.02401
[4] J. Spencer: Ramsey’s Theorem - A New Lower Bound. Journal of Comb. Th. A 18 (1975), 108-115. · Zbl 0296.05003
[5] J. Yackel: Inequalities and Asymptotic Bounds for Ramsey Numbers. Journal of Comb. Th. 13 (1972), 56-58. · Zbl 0219.05004
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.