Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
—Modeling natural and artificial systems has played a key role in various applications and has long been a task that has drawn enormous efforts. In this work, instead of explori...
Ronen Talmon, Dan Kushnir, Ronald R. Coifman, Isra...
In this paper we shall describe a very natural extension of MV-algebras, the divisible MV-algebras (DMV). Such algebraic structures will be used to give a formal description of ru...
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
Given d independent pseudorandom permutations (PRPs) i, . . . , d over {0, 1}n , it appears natural to define a pseudorandom function (PRF) by adding (or XORing) the permutation re...