Extremal graphs without four-cycles or five-cycles

Authors

  • Yongqi, Sun
  • Xiaohui, Lin
  • Yuansheng, Yang
  • Lei, Shi

Abstract

Given a set of graphs Ψ = {G1, G2, ⋯, Gk}, let ex(n; Ψ) denote the greatest size of a graph with order n that contains no subgraph isomorphic to any Gi, 1 ≤ i ≤ k. Clapham and Yang Yuansheng investigated the values of ex(n, Ψ) for Ψ = {C4}(Journal of Graph Theory, 13 (1989), 29-47 and Utilitas Mathematics, 41 (1992), 204-210) and ex(n,Ψ) for Ψ = {C 3,C4, C5}(Utilitas Mathematica, 66 (2004), 249-265). Garnick investigated them for Ψ = {C3, C 4}(Journal of Graph Theory, 17 (1993), 633-645). This paper investigates the values of ex(n, Ψ) for Ψ = {C4, C 5}, n ≤ 21.

Published

2009-09-09

How to Cite

Yongqi, Sun, Xiaohui, Lin, Yuansheng, Yang, & Lei, Shi. (2009). Extremal graphs without four-cycles or five-cycles. Utilitas Mathematica, 80. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/603

Issue

Vol. 80 (2009): Volume 80, 2009

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.