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.
机构:
Univ Cambridge, Dept Pure Math & Math Stat, Wilber Force Rd, Cambridge CB3 0WB, EnglandUniv Cambridge, Dept Pure Math & Math Stat, Wilber Force Rd, Cambridge CB3 0WB, England
Girao, Antonio
Kittipassorn, Teeradej
论文数: 0引用数: 0
h-index: 0
机构:
Chulalongkorn Univ, Dept Math & Comp Sci, Fac Sci, Bangkok 10330, ThailandUniv Cambridge, Dept Pure Math & Math Stat, Wilber Force Rd, Cambridge CB3 0WB, England
Kittipassorn, Teeradej
Popielarz, Kamil
论文数: 0引用数: 0
h-index: 0
机构:
Univ Memphis, Dept Math Sci, Memphis, TN 38152 USAUniv Cambridge, Dept Pure Math & Math Stat, Wilber Force Rd, Cambridge CB3 0WB, England