  A Kneser representation KG(H) for a graph G is a bijective assignment of
hyperedges of a hypergraph H to the vertices of G such that two vertices of G
are adjacent if and only if the corresponding hyperedges are disjoint. In this
paper, we introduce a colored version of the Turan number and use that to
determine the chromatic number of some families of graphs in terms of the
generalized Turan number of graphs. In particular, we determine the chromatic
number of every Kneser multigraph KG(H), where the vertex set of H is the edge
set of a multigraph G such that the multiplicity of each edge is greater than 1
and a hyperedge in H corresponds to a subgraph of G isomorphic to some graph in
a fixed prescribed family of simple graphs.
