1632 search results - page 7 / 327 » On special numberings of hypergraphs |
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...
JCT
2007
14 years 9 months ago
2007
In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs KGr sssS, “generalized r-uniform Kneser hypergraphs with intersection multi...
109
click to vote
GC
2012
Springer
13 years 5 months ago
2012
Springer
A cut [X, V − X] in a hypergraph with vertex-set V is the set of all edges that meet both X and V − X. Let sr(n) denote the minimum total size of any cover of the edges of the ...
ASIACRYPT
2007
Springer
15 years 1 months ago
2007
Springer
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne nu...
WG
2005
Springer
15 years 3 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...