Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Zapiski Nauchnykh Seminarov POMI, 2022, Volume 518, Pages 192–200 (Mi znsl7298)  

On the chromatic numbers of Johnson-type graphs

D. D. Cherkashin

St. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences
References:
Abstract: A Johnson type graph $J_{\pm}(n,k,t)$ is a graph whose vertex set consists of vectors from $\{-1,0,1\}^n$ of the length $\sqrt{k}$ and edges connect vertices with scalar product $t$. The paper determines the order of growth of the chromatic numbers of graphs $J_\pm(n,2,-1)$ and $J_\pm(n,3,-1)$ (logarithmic on $n$), and also $J_\pm(n,3,-2)$ (double logarithmic on $n$).
Key words and phrases: distance graphs, graph colorings, Sperner theorem.
Funding agency Grant number
Russian Science Foundation 21-11-00040
Received: 22.02.2022
Bibliographic databases:
Document Type: Article
UDC: 519.174.7, 519.174.3, 519.157.4
Language: Russian
Citation: D. D. Cherkashin, “On the chromatic numbers of Johnson-type graphs”, Combinatorics and graph theory. Part XIII, Zap. Nauchn. Sem. POMI, 518, POMI, St. Petersburg, 2022, 192–200
Citation in format AMSBIB
\Bibitem{Che22}
\by D.~D.~Cherkashin
\paper On the chromatic numbers of Johnson-type graphs
\inbook Combinatorics and graph theory. Part~XIII
\serial Zap. Nauchn. Sem. POMI
\yr 2022
\vol 518
\pages 192--200
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl7298}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4535030}
Linking options:
  • https://www.mathnet.ru/eng/znsl7298
  • https://www.mathnet.ru/eng/znsl/v518/p192
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:68
    Full-text PDF :28
    References:21
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024