Extremal Problems in Graph Theory and a Hypergraph Packing Problem
Guardado en:
| Publicado en: | PQDT - UK & Ireland (2021) |
|---|---|
| Autor principal: | |
| Publicado: |
ProQuest Dissertations & Theses
|
| Acceso en línea: | Citation/Abstract Full text outside of ProQuest |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Resumen: | <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. |
|---|---|
| Fuente: | ProQuest Dissertations & Theses Global |