On independence numbers of distance graphs with vertices in {-1,0,1} n : estimates, conjectures, and applications to the Nelson–Erdős–Hadwiger problem and the Borsuk problem | Zendy

AI Assistant Blog Pricing

On independence numbers of distance graphs with vertices in {-1,0,1} n : estimates, conjectures, and applications to the Nelson–Erdős–Hadwiger problem and the Borsuk problem

Details

The content you want is available to Zendy users.Already have an account? Click here. to sign in.