The maximal number of induced complete bipartite graphs
Abstract
The aim of this paper is to determine the maximal number of induced K(t, t) subgraphs in graphs of given order and in graphs of given size. © 1986.
Publication Title
Discrete Mathematics
Recommended Citation
Bollobás, B., Nara, C., & Tachibana, S. (1986). The maximal number of induced complete bipartite graphs. Discrete Mathematics, 62 (3), 271-275. https://doi.org/10.1016/0012-365X(86)90214-1
COinS
