63 search results - page 7 / 13 » Two-coloring Random Hypergraphs |
131
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
104
click to vote
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph co...
CPC
2006
14 years 11 months ago
2006
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
JDA
2010
14 years 10 months ago
2010
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...