Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference9 articles.
1. B. Bollobás andP. Erdős, On a Ramsey—Turán type problem,J. Comb. Th. Ser. B 21 (1976) 166–168.
2. P. Erdős, A. Hajnal, V. T. Sós andE. Szemerédi, More results on Ramsey—Turán type problems,Combinatorica,3 (1) (1983).
3. P. Erdős andA. Hajnal, On chromatic number of graphs and set systems,Acta Math. Acad. Sci. Hungar. 17 (1966) 61–99.
4. P. Erdős, On extremal problems of graphs and generalized graphs,Israel J. Math. 2 (1964) 183–190.
5. P. Erdős andV. T. Sós, Some remarks on Ramsey’s and Turán’s theorem.Comb. Theory and Appl. (P. Erdős et al. eds.)Math. Coll. Soc. J. Bolyai 4 Balatonfüred (1969) 395–404.
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献