Lower bounds on the independence numbers of distance graphs with vertices in $\{-1, 0, 1\}^n$
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910835350175744 |
|---|---|
| author | Akhiiarov, A. R. Bobu, A. V. Raigorodskii, A. M. |
| author_facet | Akhiiarov, A. R. Bobu, A. V. Raigorodskii, A. M. |
| contents | This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented, highlighting nontrivial relationships between the obtained bounds. Known upper bounds and their potential suboptimality are discussed separately. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_17120 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Lower bounds on the independence numbers of distance graphs with vertices in $\{-1, 0, 1\}^n$ Akhiiarov, A. R. Bobu, A. V. Raigorodskii, A. M. Combinatorics This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented, highlighting nontrivial relationships between the obtained bounds. Known upper bounds and their potential suboptimality are discussed separately. |
| title | Lower bounds on the independence numbers of distance graphs with vertices in $\{-1, 0, 1\}^n$ |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2412.17120 |