The following pages link to Around Borsuk's hypothesis (Q2519261):
Displaying 30 items.
- Independence numbers and chromatic numbers of some distance graphs (Q259909) (← 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)
- Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space (Q338040) (← links)
- New bounds for the distance Ramsey number (Q393923) (← links)
- On Schur's conjecture in \(\mathbb{R}^{4}\) (Q403945) (← links)
- Proof of Schur's conjecture in \(\mathbb R^D\) (Q722315) (← links)
- Hamiltonian paths in distance graphs (Q745636) (← links)
- Diameters of random distance graphs (Q1687985) (← links)
- On the multiple Borsuk numbers of sets (Q2017114) (← links)
- On the minimal number of edges in induced subgraphs of special distance graphs (Q2150630) (← 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)
- Exact modularity of line graphs of complete graphs (Q2229338) (← links)
- New lower bound on the modularity of Johnson graphs (Q2229339) (← links)
- On Borsuk's conjecture for two-distance sets (Q2249469) (← links)
- One problem on geometric Ramsey numbers (Q2258893) (← links)
- Exponentially Ramsey sets (Q2278704) (← links)
- On threshold probability for the stability of independent sets in distance graphs (Q2282860) (← links)
- Counterexamples to Borsuk's conjecture with large girth (Q2334928) (← links)
- Lower bounds for the chromatic numbers of distance graphs with large girth (Q2364552) (← links)
- Small Subgraphs in Random Distance Graphs (Q2821762) (← links)
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs (Q3466410) (← links)
- On the Frankl–Rödl theorem (Q4613521) (← links)
- (Q4965840) (← links)
- Calculation of the Gromov-Hausdorff distance using the Borsuk number (Q6115266) (← links)
- On the partition of plane sets into 6 subsets of small diameter (Q6147866) (← links)
- Modularity of some distance graphs (Q6182000) (← links)
- Estimates of the Number of Edges in Subgraphs of Johnson Graphs (Q6494808) (← links)
