On multiplicity of triangles

S. S. Rukmani (), J. Prema () and V. Vijayalakshmi ()
Additional contact information
S. S. Rukmani: Anna University, MIT Campus
J. Prema: Anna University, MIT Campus
V. Vijayalakshmi: Anna University, MIT Campus

Indian Journal of Pure and Applied Mathematics, 2015, vol. 46, issue 5, 679-693

Abstract: Abstract Let {G(n, l)} be the family of graphs where G(n, l) is obtained from the complete graph K n+l by removing the edges of a complete subgraph on l vertices. In this paper, we determine the multiplicity of triangles in any two coloring of the edges of G(n, l), for sufficiently large values of n.

Keywords: Complete graphs; edge coloring; multiplicity; triangles (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-015-0136-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:46:y:2015:i:5:d:10.1007_s13226-015-0136-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-015-0136-5

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().