English

On spanning tree congestion of Hamming graphs

Discrete Mathematics 2011-10-18 v3

Abstract

We present a tight lower bound for the spanning tree congestion of Hamming graphs.

Cite

@article{arxiv.1110.1304,
  title  = {On spanning tree congestion of Hamming graphs},
  author = {Kyohei Kozawa and Yota Otachi},
  journal= {arXiv preprint arXiv:1110.1304},
  year   = {2011}
}

Comments

3 pages, fixed typos again

R2 v1 2026-06-21T19:16:11.098Z