A Lower Bound for the Weisfeiler-Leman Dimension of Circulant Graphs
The Electronic Journal of Combinatorics · 05.06.2026 · 33 (2)
DOI: 10.37236/14534 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 05.06.2026. Verfasst von Yulai Wu und 2 weiteren Autor:innen.
Abstract (Originalsprache)
It is proved that for infinitely many positive integers $n$, there exists a circulant graph of order $n$ whose Weisfeiler-Leman dimension is at least $c\sqrt{\log n}$ for some constant $c>0$ not depending on $n$.
Zitieren
APA
Wu, Y., Ren, Q., & Ponomarenko, I. (2026). A Lower Bound for the Weisfeiler-Leman Dimension of Circulant Graphs. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14534
Vancouver
Wu Y, Ren Q, Ponomarenko I. A Lower Bound for the Weisfeiler-Leman Dimension of Circulant Graphs. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14534
BibTeX
@article{Wu2026,
author = {Wu, Yulai and Ren, Qing and Ponomarenko, Ilia},
title = {A Lower Bound for the Weisfeiler-Leman Dimension of Circulant Graphs},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {2},
doi = {10.37236/14534}
}
EUVIMED