Change search
ReferencesLink to record
Permanent link

Direct link
The subgraph containment problem in random graphs
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Algebra and Geometry.
2015 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Place, publisher, year, edition, pages
2015. , 26 p.
U.U.D.M. project report, 2015:25
National Category
Algebra and Logic
URN: urn:nbn:se:uu:diva-260377OAI: diva2:846952
Educational program
Bachelor Programme in Mathematics
Available from: 2015-08-18 Created: 2015-08-18 Last updated: 2015-08-18Bibliographically approved

Open Access in DiVA

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

By organisation
Algebra and Geometry
Algebra and Logic

Search outside of DiVA

GoogleGoogle Scholar
Total: 156 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: 497 hits
ReferencesLink to record
Permanent link

Direct link