• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
成果搜索

author:

Hou, Jianfeng (Hou, Jianfeng.) [1] (Scholars:侯建锋) | Li, Heng (Li, Heng.) [2] | Zeng, Qinghou (Zeng, Qinghou.) [3] (Scholars:曾庆厚)

Indexed by:

Scopus SCIE

Abstract:

The Turan number of a graph H, denoted by ex(n, H), is the maximum number of edges in an n-vertex graph that does not contain H as a subgraph. For a vertex v and a multi-set F of graphs, the suspension F + v of F is the graph obtained by connecting the vertex v to all vertices of F for each F is an element of F. For two integers k 1 and r 2, let Hi be a graph containing a critical edge with chromatic number r for any i is an element of {1, ... , k}, and let H = {H1,. . . , Hk} + v. In this paper, we determine ex(n, H) and characterize all the extremal graphs for sufficiently large n. This generalizes a result of Chen, Gould, Pfender and Wei on intersecting cliques.

Keyword:

Community:

  • [ 1 ] [Hou, Jianfeng]Fuzhou Univ, Ctr Discrete Math, Fuzhou 350003, Fujian, Peoples R China
  • [ 2 ] [Zeng, Qinghou]Fuzhou Univ, Ctr Discrete Math, Fuzhou 350003, Fujian, Peoples R China
  • [ 3 ] [Li, Heng]Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China

Reprint 's Address:

  • 侯建锋

    [Hou, Jianfeng]Fuzhou Univ, Ctr Discrete Math, Fuzhou 350003, Fujian, Peoples R China

Show more details

Version:

Related Keywords:

Related Article:

Source :

ELECTRONIC JOURNAL OF COMBINATORICS

ISSN: 1077-8926

Year: 2024

Issue: 4

Volume: 20

0 . 7 0 0

JCR@2023

CAS Journal Grade:4

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 1

Online/Total:365/10792872
Address:FZU Library(No.2 Xuyuan Road, Fuzhou, Fujian, PRC Post Code:350116) Contact Us:0591-22865326
Copyright:FZU Library Technical Support:Beijing Aegean Software Co., Ltd. 闽ICP备05005463号-1