Change search
ReferencesLink to record
Permanent link

Direct link
Övertäckningsdesigner och extremala hypergrafer
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2012 (Swedish)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [sv]

I denna uppsats introducerar vi grundläggande teori rörande övertäckningsdesigner och extremal hypergrafsteori för läsaren. Vidare beskriver vi en metod för atthitta alla icke-isomorfa extremalgrafer EX(n, K^r_s), för givna n, r, och s.Slutligen presenterar vi de resultat som hittats med denna metod och jämförkort hur metoden står sig mot den naiva metoden.

Abstract [en]

In this paper we introduce the reader to the fundamentals of coveringdesigns and extremal hypergraph theory. Further, we describe a methodof finding all non-isomorphic extremal hypergraphs EX(n, K^r_s), for givenn, r and s. Lastly, we present the results found by this method and makesome comparisons regarding efficiency between this and the naive method.

Place, publisher, year, edition, pages
2012. , 57 p.
Keyword [sv]
Turán, hypergraf, övertäckningsdesign
National Category
Discrete Mathematics
URN: urn:nbn:se:umu:diva-56588OAI: diva2:536019
Physics, Chemistry, Mathematics
Available from: 2012-10-31 Created: 2012-06-21 Last updated: 2012-10-31Bibliographically approved

Open Access in DiVA

fulltext(801 kB)113 downloads
File information
File name FULLTEXT01.pdfFile size 801 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Mathematics and Mathematical Statistics
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 113 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 76 hits
ReferencesLink to record
Permanent link

Direct link