uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
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.
Series
U.U.D.M. project report, 2015:25
National Category
Algebra and Logic
Identifiers
URN: urn:nbn:se:uu:diva-260377OAI: oai:DiVA.org:uu-260377DiVA: diva2:846952
Educational program
Bachelor Programme in Mathematics
Supervisors
Examiners
Available from: 2015-08-18 Created: 2015-08-18 Last updated: 2015-08-18Bibliographically approved

Open Access in DiVA

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

By organisation
Algebra and Geometry
Algebra and Logic

Search outside of DiVA

GoogleGoogle Scholar
Total: 263 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

urn-nbn

Altmetric score

urn-nbn
Total: 855 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf