Pages that link to "Item:Q2313252"
From MaRDI portal
The following pages link to On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2313252):
Displaying 15 items.
- Chromatic numbers of distance graphs without short odd cycles in rational spaces (Q2037721) (← links)
- Lower bounds on the clique-chromatic numbers of some distance graphs (Q2043671) (← links)
- Bounds on Borsuk numbers in distance graphs of a special type (Q2044127) (← links)
- On a Frankl-Wilson theorem (Q2190926) (← links)
- New bounds on clique-chromatic numbers of Johnson graphs (Q2192124) (← links)
- New lower bound on the modularity of Johnson graphs (Q2229339) (← links)
- On stability of the independence number of a certain distance graph (Q2229578) (← links)
- Modularity of some distance graphs (Q2243703) (← links)
- New bounds for the clique-chromatic numbers of Johnson graphs (Q2243705) (← links)
- On dividing sets into parts of smaller diameter (Q2243826) (← links)
- Estimate of the number of edges in subgraphs of a Johnson graph (Q2246879) (← links)
- On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2304365) (← links)
- Intersection theorems for \((- 1, 0, 1)\)-vectors (Q6181997) (← links)
- Modularity of some distance graphs (Q6182000) (← links)
- New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs (Q6604699) (← links)
