Disjoint triangles and pentagons in a graph

被引：0

作者：

Bauer, Ryan ^{[1
]}

Wang, Hong ^{[1
]}

机构：

[1] Univ Idaho, Dept Math, Moscow, ID 83844 USA

来源：

AUSTRALASIAN JOURNAL OF COMBINATORICS | 2010年 / 46卷

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let n, s, and t be integers with s >= 1, t >= 0, and n = 3s + 5t. Let G be a graph of order n such that the minimum degree of G is at least ( n + s + t)/2. Then G contains s + t independent subgraphs such that s of them are triangles and t of them are pentagons.

引用

页码：79 / 89

页数：11

共 50 条

[31] Disjoint long cycles in a graph
WANG Hong
[J]. Science China Mathematics, 2013, 56 (10) : 1983 - 1998
[32] Disjoint long cycles in a graph
Hong Wang
[J]. Science China Mathematics, 2013, 56 : 1983 - 1998
[33] On the Existence of Disjoint Cycles in a Graph
Hikoe Enomoto
[J]. Combinatorica, 1998, 18 : 487 - 492
[34] On the existence of disjoint cycles in a graph
Enomoto, H
[J]. COMBINATORICA, 1998, 18 (04) : 487 - 492
[35] ON NUMBER OF DISJOINT EDGES IN A GRAPH
WEINSTEIN, JM
[J]. CANADIAN JOURNAL OF MATHEMATICS, 1963, 15 (01): : 106 - &
[36] Extremal numbers of disjoint triangles in r-partite graphs
Zhang, Junxue
[J]. DISCRETE MATHEMATICS, 2023, 346 (09)
[37] Counting triangles in graphs without vertex disjoint odd cycles
Hou, Jianfeng
Yang, Caihong
Zeng, Qinghou
[J]. DISCRETE MATHEMATICS, 2024, 347 (07)
[38] Edge disjoint monochromatic triangles in 2-colored graphs
Erdos, P
Faudree, RJ
Gould, RJ
Jacobson, MS
Lehel, J
[J]. DISCRETE MATHEMATICS, 2001, 231 (1-3) : 135 - 141
[39] Many disjoint triangles in co-triangle-free graphs
Tyomkyn, Mykhaylo
[J]. COMBINATORICS PROBABILITY & COMPUTING, 2021, 30 (01): : 153 - 162
[40] ON THE NUMBER OF EDGE-DISJOINT TRIANGLES IN GRAPHS OF GIVEN SIZE
GYORI, E
[J]. COMBINATORICS /, 1988, 52 : 267 - 276

← 1 2 3 4 5 →