On uniform intersection numbers

被引：0

作者：

Tsuchiya, M

机构：

[1] Tokai Univ, Dept Math Sci, Hiratsuka, Kanagawa 25912, Japan

[2] MIT, Dept Math, Cambridge, MA 02139 USA

来源：

ARS COMBINATORIA | 1998年 / 48卷

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper, we consider total clique covers and uniform intersection numbers on multifamilies. We determine the uniform intersection numbers of graphs in term of total clique covers. From this result and some properties of intersection graphs an multifamilies, we determine the uniform intersection numbers of some families of graphs. We also deal with the NP-completeness of uniform intersection numbers.

引用

页码：225 / 232

页数：8

共 8 条

[1] [Anonymous], 1987, Combinatorics of finite sets
[2] ERA H, 1990, UTILITAS MATHEMATICA, V37, P3
[3] REPRESENTATION OF A GRAPH BY SET INTERSECTIONS
ERDOS, P
GOODMAN, AW
POSA, L
[J]. CANADIAN JOURNAL OF MATHEMATICS, 1966, 18 (01): : 106 - &
[4] Harary F., 1972, GRAPH THEORY
[5] COVERING EDGES BY CLIQUES WITH REGARD TO KEYWORD CONFLICTS AND INTERSECTION GRAPHS
KOU, LT
STOCKMEYER, LJ
WONG, CK
[J]. COMMUNICATIONS OF THE ACM, 1978, 21 (02) : 135 - 139
[6] COMPLEXITY OF REPRESENTATION OF GRAPHS BY SET SYSTEMS
POLJAK, S
RODL, V
TURZIK, D
[J]. DISCRETE APPLIED MATHEMATICS, 1981, 3 (04) : 301 - 312
[7] ON ANTICHAIN INTERSECTION-NUMBERS, TOTAL CLIQUE COVERS AND REGULAR GRAPHS
TSUCHIYA, M
[J]. DISCRETE MATHEMATICS, 1994, 127 (1-3) : 305 - 318
[8] TSUCHIYA M, ONTERSECTION NUMBERS

← 1 →