Show simple item record

dc.contributor.advisorYu, Xingxing
dc.contributor.authorXie, Shijie
dc.date.accessioned2020-01-14T14:45:16Z
dc.date.available2020-01-14T14:45:16Z
dc.date.created2019-12
dc.date.issued2019-11-11
dc.date.submittedDecember 2019
dc.identifier.urihttp://hdl.handle.net/1853/62273
dc.description.abstractLet $G$ be a graph and $a_0, a_1, a_2, b_1,$ and $b_2$ be distinct vertices of $G$. Motivated by their work on Four Color Theorem, Hadwiger's conjecture for $K_6$, and J\o rgensen's conjecture, Robertson and Seymour asked when does $G$ contain disjoint connected subgraphs $G_1, G_2$, such that $\{a_0, a_1, a_2\}\subseteq V(G_1)$ and $\{b_1, b_2\}\subseteq V(G_2)$. We prove that if $G$ is 6-connected then such $G_1,G_2$ exist. Joint work with Robin Thomas and Xingxing Yu.
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherGeorgia Institute of Technology
dc.subjectGraph theory
dc.subjectDisjoint paths in graphs
dc.subjectTwo-three linked graphs
dc.subject6-connected graphs
dc.title6-connected graphs are two-three linked
dc.typeDissertation
dc.description.degreePh.D.
dc.contributor.departmentMathematics
thesis.degree.levelDoctoral
dc.contributor.committeeMemberThomas, Robin
dc.contributor.committeeMemberTetali, Prasad
dc.contributor.committeeMemberPeng, Richard
dc.contributor.committeeMemberWarnke, Lutz
dc.date.updated2020-01-14T14:45:16Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record