Return to search

Construction of combinatorial designs with prescribed automorphism groups

In this dissertation, we study some open problems concerning the existence or non-existence of some combinatorial designs. We give the construction or proof of non-existence of some Steiner systems, large sets of designs, and graph designs, with prescribed automorphism groups. / by Emre KolotoƦglu. / Thesis (Ph.D.)--Florida Atlantic University, 2013. / Includes bibliography. / Mode of access: World Wide Web. / System requirements: Adobe Reader.

Identiferoai:union.ndltd.org:fau.edu/oai:fau.digital.flvc.org:fau_4102
ContributorsKolotoglu, Emre., Charles E. Schmidt College of Science, Department of Mathematical Sciences
PublisherFlorida Atlantic University
Source SetsFlorida Atlantic University
LanguageEnglish
Detected LanguageEnglish
TypeText, Electronic Thesis or Dissertation
Formatviii, 85 p. : ill., electronic
Rightshttp://rightsstatements.org/vocab/InC/1.0/

Page generated in 0.0017 seconds