学位论文详细信息
Extremal problems on edge-colorings, independent sets, and cycle spectra of graphs
Graph Theory;Extremal Problems;Ramsey Theory
Milans, Kevin G.
关键词: Graph Theory;    Extremal Problems;    Ramsey Theory;   
Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/16762/Milans_Kevin.pdf?sequence=1&isAllowed=y
美国|英语
来源: The Illinois Digital Environment for Access to Learning and Scholarship
PDF
【 摘 要 】

We study problems in extremal graph theory with respect to edge-colorings, independent sets, and cycle spectra.In Chapters 2 and 3, we present results in Ramsey theory, where we seek Ramsey host graphs with small maximum degree.In Chapter 4, we study a Ramsey-type problem on edge-labeled trees, where we seek subtrees that have a small number of path-labels.In Chapter 5, we examine parity edge-colorings, which have connections to additive combinatorics and the minimum dimension of a hypercube in which a tree embeds.In Chapter 6, we prove results on the chromatic number of circle graphs with clique number at most 3.The tournament analogue of an independent set is an acyclic set.In Chapter 7, we present results on the size of maximum acyclic sets in k-majority tournaments.In Chapter 8, we prove a lower bound on the size of the cycle spectra of Hamiltonian graphs.

【 预 览 】
附件列表
Files Size Format View
Extremal problems on edge-colorings, independent sets, and cycle spectra of graphs 927KB PDF download
  文献评价指标  
  下载次数:0次 浏览次数:2次