Content area
This thesis improves on the best result of an open problem, showing that Hamiltonian graphs with low independence number are pancyclic. It also describes graphs with the most triangle-free 5- and 6-colourings and generalises a packing theorem for degenerate graphs from graphs to hypergraphs.
Details
Identifier / keyword
Title
Author
Publication year
2021
Degree date
2021
School code
0649
Source
DAI-C 84/5(E), Dissertation Abstracts International
University/institution
London School of Economics and Political Science (United Kingdom)
University location
England
Degree
Ph.D.
Source type
Dissertation or Thesis
Language
English
Document type
Dissertation/Thesis
Note
Bibliographic data provided by EThOS, the British Library’s UK thesis service. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.850226
Dissertation/thesis number
30216433
ProQuest document ID
2732212274
Document URL
https://www.proquest.com/dissertations-theses/extremal-problems-graph-theory-hypergraph-packing/docview/2732212274/se-2?accountid=208611
Go to Library Record
Copyright
Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
Database
ProQuest One Academic