A Generalization of Kneser Graphs

Graphs which are analogs of Kneser graphs are studied. The problem of determining the chromatic numbers of these graphs is considered. It is shown that their structure is similar to that of Kneser graphs. Upper and lower bounds for the chromatic numbers of the graphs under examination are obtained. For certain parameter values, an order-sharp estimate of the chromatic numbers is found, and in some cases, the exact value of the quantity in question is determined.