Báo cáo toán học: "List coloring hypergraphs" pdf

... fixed coloring χ of X, P (B c χ ) < 2 exp  − |Y | 8(8s) s  . Since there are at most s |X| colorings o f X, and since by Claim 1 |Y |  pn/2 and |X|  2p 2 n, the expected number of colorings ... journal of combinatorics 17 (2010), #R129 8 1.1 List coloring graphs The notion of list -coloring is a generalization of the notion of proper coloring, a nd has been studied extensively for...

Ngày tải lên: 08/08/2014, 12:22

... representative fr om each component and translating the coloring by that representative (this is where we use choice). However, no measurable coloring of this graph exists with even countably many ... are using here. It seems plausible that one of them could be made more amenable to dealing with colorings of infinite graphs. For example, if we can assign to each vertex x a vector v x such...

Ngày tải lên: 07/08/2014, 21:21

... cryptographic applications. August 2008. http://csrc.nist.gov/groups/ST/toolkit/rng/documents/SP800-22b .pdf [15] T Ritter, Randomness tests: a literature survey. http://www.ciphersbyritter.com/RES/RANDTEST.HTM, ... small domain. Advances in Cryptology. CRYPTO 2009. http://www.cs.ucdavis.edu/~rogaway/papers/thorp .pdf [18] N Koblitz, A Course in Number Theory and Cryptography, 2nd ed...

Ngày tải lên: 20/06/2014, 20:20

Ngày tải lên: 05/08/2014, 15:21

... by deleting the edges of C.ThenG  has an L-edge -coloring by the induction hypothesis, and this L-edge -coloring can be extended to an L-edge -coloring of G, because every edge of C is incident ... deleting the vertices v 1 , v 2 ,andw.ThenG  has an L-edge -coloring by the induction hypothesis, and this L-edge -coloring extends to an L-edge -coloring of G by Lemma 2.2. Thus we may ass...

Ngày tải lên: 07/08/2014, 06:20

... 68W25. Keywords: graph coloring, online algorithms. Abstract The problem of online coloring an unknown graph is known to be hard. Here we consider the problem of online coloring in the relaxed ... any online independent set algorithm has a performance ratio at least N/8. 1 Online Graph Coloring Graph coloring is the problem of assigning the fewest possible colors to the vertices of a...

Ngày tải lên: 07/08/2014, 06:20

Ngày tải lên: 07/08/2014, 07:21

Ngày tải lên: 07/08/2014, 08:20

... 2-colored. Every star coloring is an acyclic coloring but star coloring a graph typically requires more colors than acyclically coloring the same graph. In general, many star coloring questions ... such that G has a k-star coloring is the star chromatic number of G. In 1973 Gr¨unbaum [5] introduced star colorings and acyclic colorings. An acyclic col- oring is a proper coloring...

Ngày tải lên: 07/08/2014, 21:20

... and list-distinguishing a graph. Keywords: Distinguishing Coloring, List Coloring, List-Distinguishing Coloring . 1 Introduction A vertex coloring of a graph G, f : V (G) → {1, , r} is said to be ... above, to extend our coloring of A to a list-distinguishing coloring of O(u) in which no vertices aside fro m u and uσ 3 receive color c u . Any element g ∈ D n that fixes such a colori...

Ngày tải lên: 08/08/2014, 14:23