曲阜师范大学学报（自然科学版）Issue(2)：41-44,4.DOI:10.3969/j.issn.1001-5337.2014.2.004
给定色可行集的极大混合超图
The Maximum Mixed Hypergraph with a Given Feasible Set
段潇潇 1朱潇 2刁科凤1
作者信息
- 1. 临沂大学理学院，276005，临沂市
- 2. 山东师范大学数学科学学院，250014，山东省济南市
- 折叠
摘要
Abstract
A mixed hypergraph H=(X ,C,φ)is called a bi-hypergraph if C" φ ,and the chromatic spec-trum of H is R (H)=(r 1,…,rχ),where r i(i =1,2,…,χ)is the number of strict i-colorings of H,χis theupper chromatic number of H.In this paper,we prove that there are bi-hypergrphs with certain feasible setand arbitrarily large number of bi-edges and vertices.As a result,we partially solve an open problem pro-posed by Voloshin.关键词
混合超图/严格i-染色/可行集/色谱Key words
mixed hypergraph/strict coloring/feasible set/chromatic spectrum分类
数理科学引用本文复制引用
段潇潇,朱潇,刁科凤..给定色可行集的极大混合超图[J].曲阜师范大学学报（自然科学版）,2014,(2):41-44,4.
