Maximum number of cycles in graphs and multigraphs

Simple item page
dc.contributor.authorArman, Andrii
dc.contributor.examiningcommitteeDoob, Michael (Mathematics) Kocay, William (Computer Science) Pikhurko, Oleg (Mathematics Institute, University of Warwick)en_US
dc.contributor.supervisorGunderson, David (Mathematics)en_US
dc.date.accessioned2018-05-31T19:36:39Z
dc.date.available2018-05-31T19:36:39Z
dc.date.issued2016en_US
dc.date.submitted2018-05-08T22:05:40Zen
dc.date.submitted2018-05-24T16:38:45Zen
dc.degree.disciplineMathematicsen_US
dc.degree.levelDoctor of Philosophy (Ph.D.)en_US
dc.description.abstractIn this thesis a problem of determining the maximum number of cycles for the following classes of graphs is considered: triangle-free graphs; K_r-free graphs; graphs with m edges; graphs with n vertices and m edges; multigraphs with m edges and multigraphs with n vertices and m edges.en_US
dc.description.noteOctober 2018en_US
dc.identifier.citationA. Arman, D. Gunderson, and S. Tsaturian, Triangle-free graphs with the maximum number of cycles, Discrete Math. 339 (2016), 699--711en_US
dc.identifier.urihttp://hdl.handle.net/1993/33030
dc.language.isoengen_US
dc.publisherElsevieren_US
dc.rightsopen accessen_US
dc.subjectGraph Theory, Cyclesen_US
dc.titleMaximum number of cycles in graphs and multigraphsen_US
dc.typedoctoral thesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Thesis24May2018.pdf
Size:
545.73 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.2 KB
Format:
Item-specific license agreed to upon submission
Description:
Download
Collections
FGS - Electronic Theses and Practica