Abstract
In this paper, we determine a lower bound for the multiplicity of quadrilaterals (cycles on four vertices) in complete graph Kn for any positive integer n.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. Chvatal and F. Harary, Generalised Ramsey theory for graphs II, small diagonal numbers, Proceedings of the American Mathematical Society, 32(2) (1972), 389–394.
P. Erdos and J. W. Moon, On subgraphs of the complete bipartite graph, Canadian Mathematical Bulletin, 7(1) (1964), 35–39.
A. W. Goodman, On sets of acquaintances and strangers at any party, American Mathematical Monthly, 66 (1951), 778–783.
F. Harary and G. Prins, Generalised Ramsey theory for graphs IV, Ramsey multiplicities, Networks, 4 (1974), 163–173.
G. Lorden, Blue-empty chromatic graphs, American Mathematical Monthly, 69 (1962), 114–120.
J. W. Moon and L. Moser, On chromatic bipartite graphs, Mathematics magazine, 35 (1962), 225–227.
S. S. Rukmani and V. Vijayalakshmi, On multiplicity of quadrilaterals, AKCE International Journal of Graphs and Combinatorics, 12 (2015), 221–223.
L. Sauve, On chromatic graphs, American Mathematical Monthly, 68 (1961), 107–111.
A. J. Schwenk, Acquaintance graph party problem, American Mathematical Monthly, 70 (1972), 113–117.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by DST - INSPIRE Fellowship, India
Rights and permissions
About this article
Cite this article
Prema, J., Vijayalakshmi, V. On Multiplicity of Quadrilaterals in Complete Graphs. Indian J Pure Appl Math 50, 83–94 (2019). https://doi.org/10.1007/s13226-019-0308-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13226-019-0308-9