Abstract
dc:description.abstractLet $G$ be a graph and a0, a1, a2, b1, and b2 be distinct vertices of $G$. Motivated by their work on Four Color Theorem, Hadwiger's conjecture for K6, and J\o rgensen's conjecture, Robertson and Seymour asked when does $G$ contain disjoint connected subgraphs G1, G2, such that \{a0, a1, a2\}\subseteq V(G1) and \{b1, b2\}\subseteq V(G2). We prove that if $G$ is 6-connected then such G1,G2 exist. Joint work with Robin Thomas and Xingxing Yu.
Degree
thesis:*- Level thesis:degree_level
- Doctoral
- Department dc:contributor.department
- Mathematics
- Grantor dc:publisher
- Georgia Institute of Technology
- Year dc:date.issued
- 2019
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Xie, Shijie
- Advisor dc:contributor.advisor
-
- Yu, Xingxing
- Committee members dc:contributor.committeemember
-
- Thomas, Robin
- Tetali, Prasad
- Peng, Richard
- Warnke, Lutz
Subjects
dc:subject × 4Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1853/62273