Pages that link to "Item:Q2314127"
From MaRDI portal
The following pages link to The number of edges in induced subgraphs of some distance graphs (Q2314127):
Displaying 18 items.
- On the number of edges in induced subgraphs of a special distance graph (Q325666) (← links)
- New Turán type bounds for Johnson graphs (Q2068827) (← links)
- On the minimal number of edges in induced subgraphs of special distance graphs (Q2150630) (← links)
- On a Frankl-Wilson theorem (Q2190926) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- New bounds on clique-chromatic numbers of Johnson graphs (Q2192124) (← links)
- On the chromatic numbers corresponding to exponentially Ramsey sets (Q2202680) (← 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 threshold probability for the stability of independent sets in distance graphs (Q2282860) (← links)
- On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2304365) (← links)
- (Q3378353) (← links)
- (Q5488368) (← links)
- Modularity of some distance graphs (Q6182000) (← links)
- Estimates of the Number of Edges in Subgraphs of Johnson Graphs (Q6494808) (← links)
- New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs (Q6604699) (← links)
- Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph (Q6639684) (← links)
