The following pages link to Codes with forbidden distances (Q1970693):
Displaying 18 items.
- Independence numbers of random subgraphs of a distance graph (Q296011) (← links)
- On the number of edges in induced subgraphs of a special distance graph (Q325666) (← links)
- Independence numbers of random subgraphs of distance graphs (Q325669) (← links)
- A new estimate for the number of edges in induced subgraphs of a special distance graph (Q327309) (← links)
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection (Q892713) (← links)
- Diameters of random distance graphs (Q1687985) (← links)
- New Turán type bounds for Johnson graphs (Q2068827) (← links)
- On generalized Erdős-Ginzburg-Ziv constants for \(\mathbb{Z}_2^d\) (Q2174953) (← links)
- Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size (Q2190920) (← links)
- On a Frankl-Wilson theorem (Q2190926) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections (Q2262987) (← links)
- On threshold probability for the stability of independent sets in distance graphs (Q2282860) (← links)
- The number of edges in induced subgraphs of some distance graphs (Q2314127) (← links)
- New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs (Q2342346) (← links)
- New upper bound for the chromatic number of a random subgraph of a distance graph (Q2352580) (← links)
- New results on two hypercube coloring problems (Q2446885) (← links)
- Estimates of the Number of Edges in Subgraphs of Johnson Graphs (Q6494808) (← links)
