Author:
Bollobás Béla,Egawa Yoshimi,Harris Andrew,Jin Guoping
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. Beineke, L.W., Harary, F.: The maximum number of strongly connected subtournaments, Can. Math. Bull.8, 491–498 (1965)
2. Bollobás, B.: Extremal Graph Theory, Academic Press, London-New York-San Francisco, pp. xx + 488 (1978)
3. Bollobás, B., Nara, C., Tachibana, S.: The maximal number of induced complete bipartite subgroups, Discrete Math.62, 271–275 (1986)
4. Brown, J., Sidorenko, A.: The inducibility of complete bipartite graphs, Journal of Graph Theory18, 629–645 (1994)
5. Erdös, P.: On the number of complete subgraphs contained in certain graphs, Publ. Math. Inst. Hungar. Acad. Sci.1, 459–464 (1962)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献