Extremal Problems in Graph Theory and a Hypergraph Packing Problem

Guardat en:
Dades bibliogràfiques
Publicat a:PQDT - UK & Ireland (2021)
Autor principal: Dankovics, Attila
Publicat:
ProQuest Dissertations & Theses
Accés en línia:Citation/Abstract
Full text outside of ProQuest
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
Descripció
Resum:<meta name='ValidationSchema' content='http://www.w3.org/2002/08/xhtml/xhtml1-strict.xsd'/>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.
Font:ProQuest Dissertations & Theses Global