We introduce the notion of a of a hypergraph, which is a subset of vertices to be colored so that at least two vertices are of the same color. Hypergraphs with both and are called mixed hypergraphs. The maximal number of colors for which there exists a mixed hypergraph coloring using all the colors is called the upper chromatic number of a hypergraph H and is denoted by X(H). An algorithm for c...

Let R be ring and M a right R-module. This article introduces the concept of τ −⊕-supplemented modules as follows: Given a hereditary torsion theory in Mod-R with associated torsion functor τ we say that a module M is τ −⊕-supplemented when for every submodule N of M there exists a direct summand K of M such that M = N +K and N ∩K is τ−torsion, and M is called completely τ −⊕-supplemented if ev...

We obtain a characterization of left perfect rings via superstability the class flat modules with pure embeddings. $\mathbf{Theorem.}$ For ring $R$ following are equivalent. - is perfect. The $R$-modules embeddings superstable. There exists $\lambda \geq (|R| + \aleph_0)^+$ such that has uniqueness limit models cardinality $\lambda$. Every model in $\Sigma$-cotorsion. A key step our argum...

A new way of constructing (minimal) perfect hash functions is described. The technique considerably reduces the overhead associated with resolving buckets in two-level hashing schemes. Evaluating a hash function requires just one multiplication and a few additions apart from primitive bit operations. The number of accesses to memory is two, one of which is to a fixed location. This improves the...

We consider the problem of covering the complete r-uniform hypergraphs on n vertices using complete r-partite graphs. We obtain lower bounds on the size of such a covering. For small values of r our result implies a lower bound of Ω( e r r √ r n log n) on the size of any such covering. This improves the previous bound of Ω(rn log n) due to Snir [5]. We also obtain good lower bounds on the size ...

In the present paper, the minimal proper alternating cycle (MPAC) rotation graph R(G) of perfect matchings of a plane bipartite graph G is defined. We show that an MPAC rotation graph R(G) of G is a directed rooted tree, and thus extend such a result for generalized polyhex graphs to arbitrary plane bipartite graphs. As an immediate result, we describe a one-to-one correspondence between MPAC s...

Perfect phylogeny consisting of determining the compatibility of a set of characters is known to be NP-complete [4,28]. We propose in this article a conjecture on the necessary and sufficient conditions of compatibility: Given a set C of r-states full characters, there exists a function f(r) such that C is compatible iff every set of f(r) characters of C is compatible. According to [7,9,8,25,11...

Perfect phylogeny consisting of determining the compatibility of a set of characters is known to be NP-complete [5, 30]. We propose in this article a conjecture on the necessary and sufficient conditions of compatibility: Given a set C of r-states full characters, there exists a function f(r) such that C is compatible iff every set of f(r) characters of C is compatible. According to [8, 10, 9, ...