61 search results - page 6 / 13 » The chromatic numbers of random hypergraphs |
DM
2008
14 years 9 months ago
2008
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...
75
Voted
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
: A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a ver...
108
click to vote
KDD
2012
ACM
13 years 18 hour ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
SIAMDM
2008
14 years 9 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
RSA
2010
14 years 8 months ago
2010
We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n, p) with edge probability p = c/ n−1 d−1...