Pages that link to "Item:Q3691691"

The following pages link to On the chromatic number of the general Kneser-graph (Q3691691):

Displaying 33 items.

• On random subgraphs of Kneser and Schrijver graphs (Q272313) (← links)
• The chromatic number of finite type-graphs (Q345136) (← links)
• Shifts of the stable Kneser graphs and hom-idempotence (Q518173) (← links)
• On the chromatic number of \(q\)-Kneser graphs (Q690656) (← links)
• Covering radius and the chromatic number of Kneser graphs (Q805622) (← links)
• The non-crossing graph (Q813926) (← links)
• Circular coloring and Mycielski construction (Q968430) (← links)
• Large disjoint subgraphs with the same order and size (Q1024273) (← links)
• Extremal problems concerning Kneser-graphs (Q1057858) (← links)
• The odd girth of the generalised Kneser graph (Q1367590) (← links)
• The multichromatic numbers of some Kneser graphs (Q1584256) (← links)
• On the chromatic number of a subgraph of the Kneser graph (Q1792105) (← links)
• Chromatic number via Turán number (Q2012520) (← links)
• On the chromatic number of two generalized Kneser graphs (Q2066011) (← links)
• Clique number of Xor products of Kneser graphs (Q2138983) (← links)
• Sharp bounds for the chromatic number of random Kneser graphs (Q2171013) (← links)
• On the chromatic number of generalized Kneser graphs and Hadamard matrices (Q2280005) (← links)
• Chromatic numbers of Kneser-type graphs (Q2299637) (← links)
• On the chromatic number of generalized Kneser hypergraphs (Q2323090) (← links)
• On chromatic number and minimum cut (Q2338633) (← links)
• On the bandwidth of the Kneser graph (Q2357135) (← links)
• On the chromatic number of some geometric type Kneser graphs (Q2387203) (← links)
• A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\) (Q2411599) (← links)
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
• On the diameter of Kneser graphs (Q2581434) (← links)
• (Q3445389) (← links)
• The Chromatic Number of Kneser Hypergraphs (Q3743337) (← links)
• The chromatic number of extended odd graphs is four (Q3819086) (← links)
• On the chromatic number of Kneser hypergraphs (Q4330574) (← links)
• (Q4346810) (← links)
• Extremal problems in hypergraph colourings (Q5112450) (← links)
• Large cycles in generalized Johnson graphs (Q6084722) (← links)
• Total dominator chromatic number of Kneser graphs (Q6166235) (← links)