An Improved Finiteness Theorem for Graphical -Designs

Yeow Meng CheeSSRN 2001

Abstract

We prove that there exist only finitely many nontrivial graphical -() designs when ≤ 4/3. This improves a previous result of Betten, Klin, Laue, and Wassermann.
BibTeX
@misc{chee2001improved,
  author = {Yeow Meng Chee},
  title = {{An Improved Finiteness Theorem for Graphical -Designs}},
  year = {2001},
  howpublished = {SSRN},
}

Loading related content...

Figure