Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference8 articles.
1. P. Erdős, G. Szekeres: A combinatorial problem in geometry, Compositio Math. 2 (1935), 463–470.
2. P. Erdős: On the number of complete subgraphs contained in certain graphs, Publ. Math. Inst. Hung. Acad. Sci., VII, Ser. A 3 (1962), 459–464.
3. F. Franek, V. Rödl: 2-colourings of complete graphs with small number of monochromatic K4 subgraphs, Discrete Math. 114 (1993), 199–203.
4. F. Franek, V. Rödl: On Erdős’s conjecture on multiplicites of complete subgraphs, Combinatorica 22(3) (2002), 451–454.
5. G. Giraud: Sur la problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey, J. Combin. Theory Ser. B 27 (1979), 237–253.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献