Pages that link to "Item:Q2866446"
From MaRDI portal
The following pages link to Coloring some finite sets in {R}^{n} (Q2866446):
Displaying 19 items.
- Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
- 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 stability of some Erdős-Ko-Rado type results (Q507514) (← links)
- Hamiltonian paths in distance graphs (Q745636) (← links)
- Diameters of random distance graphs (Q1687985) (← links)
- On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
- Chromatic numbers of some distance graphs (Q2191956) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- On threshold probability for the stability of independent sets in distance graphs (Q2282860) (← links)
- Chromatic numbers of Kneser-type graphs (Q2299637) (← links)
- On the chromatic number of random subgraphs of a certain distance graph (Q2322889) (← links)
- New upper bound for the chromatic number of a random subgraph of a distance graph (Q2352580) (← links)
- On chromatic numbers of close-to-Kneser distance graphs (Q2364457) (← links)
- On the number of edges in a uniform hypergraph with a range of permitted intersections (Q2411798) (← links)
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs (Q3466410) (← links)
- Independence numbers of Johnson-type graphs (Q6115445) (← links)
