131 search results - page 5 / 27 » Hypergraphs with independent neighborhoods |
JCT
2007
13 years 7 months ago
2007
CC
2000
Springer
13 years 7 months ago
2000
Springer
JCT
2008
13 years 7 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
DM
2008
13 years 7 months ago
2008
We prove that the number of minimal transversals (and also the number of maximal independent sets) in a 3-uniform hypergraph with n vertices is at most cn , where c