61 search results - page 1 / 13 » The chromatic numbers of random hypergraphs |
80
Voted
RSA
1998
15 years 23 days ago
1998
: For a pair of integers 1F␥-r, the ␥-chromatic number of an r-uniform Ž .hypergraph Hs V, E is the minimal k, for which there exists a partition of V into subsets < <T ...
127
Voted
ARSCOM
2004
15 years 1 months ago
2004
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...
117
Voted
ARSCOM
2006
15 years 1 months ago
2006
In this paper we define the concept of clique number of uniform hypergraph and study its relationship with circular chromatic number and clique number. For every positive integer ...
150
Voted
APAL
2011
14 years 8 months ago
2011
Abstract. We give classical proofs, strengthenings, and generalizations of Lecomte’s characterizations of analytic ω-dimensional hypergraphs with countable Borel chromatic numbe...
82
Voted
JCT
2007
15 years 1 months ago
2007
