63 search results - page 2 / 13 » Two-coloring Random Hypergraphs |
82
Voted
CCCG
2010
15 years 1 months ago
2010
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by ha...
105
Voted
ICC
2008
IEEE
15 years 6 months ago
2008
IEEE
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
RSA
1998
14 years 11 months 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 ...
73
Voted
RSA
2008
14 years 11 months ago
2008
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
Denote by an -component a connected b-uniform hypergraph with k edges and k(b - 1) - vertices. We prove that the expected number of creations of -component during a random hypergr...