EUVIMEDOpdag EUVIMED
Crossref

A Lower Bound for the Weisfeiler-Leman Dimension of Circulant Graphs

Yulai Wu, Qing Ren, Ilia Ponomarenko

The Electronic Journal of Combinatorics · 2026-06-05 · 33 (2)

DOI: 10.37236/14534 ↗

At a glance

Journal article in The Electronic Journal of Combinatorics, published online on 2026-06-05. Written by Yulai Wu and 2 co-authors.

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

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$.

Cite

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}
}
Start for free →