Extremal Problems in Graph Theory and a Hypergraph Packing Problem

Guardado en:
Detalles Bibliográficos
Publicado en:PQDT - UK & Ireland (2021)
Autor principal: Dankovics, Attila
Publicado:
ProQuest Dissertations & Theses
Acceso en línea:Citation/Abstract
Full text outside of ProQuest
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

MARC

LEADER 00000nab a2200000uu 4500
001 2732212274
003 UK-CbPIL
035 |a 2732212274 
045 2 |b d20210101  |b d20211231 
084 |a 101309  |2 nlm 
100 1 |a Dankovics, Attila 
245 1 |a <html><head><meta name='ValidationSchema' content='http://www.w3.org/2002/08/xhtml/xhtml1-strict.xsd'/><title></title></head><body>Extremal Problems in Graph Theory and a Hypergraph Packing Problem</body></html> 
260 |b ProQuest Dissertations & Theses  |c 2021 
513 |a Dissertation/Thesis 
520 3 |a <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. 
773 0 |t PQDT - UK & Ireland  |g (2021) 
786 0 |d ProQuest  |t ProQuest Dissertations & Theses Global 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/2732212274/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch 
856 4 0 |3 Full text outside of ProQuest  |u http://etheses.lse.ac.uk/4357/