The following pages link to A generalization of Kneser graphs (Q2191979):
Displaying 22 items.
- A survey on Knödel graphs. (Q1427198) (← links)
- Chromatic number via Turán number (Q2012520) (← links)
- Bounds on Borsuk numbers in distance graphs of a special type (Q2044127) (← links)
- On the chromatic number of two generalized Kneser graphs (Q2066011) (← links)
- New Turán type bounds for Johnson graphs (Q2068827) (← links)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) (Q2113406) (← links)
- Treewidth of the generalized Kneser graphs (Q2121803) (← links)
- On Ramsey numbers for arbitrary sequences of graphs (Q2145747) (← links)
- On the minimal number of edges in induced subgraphs of special distance graphs (Q2150630) (← links)
- On stability of the independence number of a certain distance graph (Q2229578) (← links)
- On dividing sets into parts of smaller diameter (Q2243826) (← links)
- Variants of k-regular nearest neighbor graph and their construction (Q2361494) (← links)
- On \(b\)-continuity of Kneser graphs of type \(\mathrm{KG}(2k+1,k)\). (Q2804789) (← links)
- (Q3108693) (← links)
- Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs (Q3583310) (← links)
- Unraveling k-page graphs (Q3708844) (← links)
- (Q4431268) (← links)
- A GENERALISATION OF HIGHER-RANK GRAPHS (Q5069272) (← links)
- (Q5522764) (← links)
- (Q5753981) (← links)
- The (generalized) orthogonality dimension of (generalized) kneser graphs: bounds and applications (Q6115359) (← links)
- Modularity of some distance graphs (Q6182000) (← links)
