I will introduce two types of code design problems of some practical interest in understanding complexities of dependencies in relational database systems.One p
A parameter is locally if it involves an induced subgraph of G that is isomorphic to a given graph H (for example, minimum degree, and so on); global, otherwise
Let Fn denote the nth Fibonacci number and Ln denote the nth Lucas number.Melham conjectured that for any n, m ≥ 1, the sum L1L3L5 … L2m+1 Σr=1 F2m2r+1can be
Graph coloring is an old subject with many important applications.Variants of graph coloring are not only important in their various applications, but also they
Each code can be characterized as an independent set of a graph or a hypergraph.By applying some results on the lower bound of independent number, we improve th