Title:
Approximating the circumference of 3-connected claw-free graphs
Approximating the circumference of 3-connected claw-free graphs
| dc.contributor.advisor | Yu, Xingxing | |
| dc.contributor.author | Bilinski, Mark | en_US |
| dc.contributor.committeeMember | Duke, Richard | |
| dc.contributor.committeeMember | Tetali, Prasad | |
| dc.contributor.committeeMember | Thomas, Robin | |
| dc.contributor.committeeMember | Vigoda, Eric | |
| dc.contributor.department | Mathematics | en_US |
| dc.date.accessioned | 2009-01-22T15:42:13Z | |
| dc.date.available | 2009-01-22T15:42:13Z | |
| dc.date.issued | 2008-08-25 | en_US |
| dc.description.abstract | Jackson and Wormald show that every 3-connected K_1,d-free graph, on n vertices, contains a cycle of length at least 1/2 n^g(d) where g(d) = (log_2 6 + 2 log_2 (2d+1))^-1. For d = 3, g(d) ~ 0.122. Improving this bound, we prove that if G is a 3-connected claw-free graph on at least 6 vertices, then there exists a cycle C in G such that |E(C)| is at least c n^g+5, where g = log_3 2 and c > 1/7 is a constant. To do this, we instead prove a stronger theorem that requires the cycle to contain two specified edges. We then use Tutte decomposition to partition the graph and then use the inductive hypothesis of our theorem to find paths or cycles in the different parts of the decomposition. | en_US |
| dc.description.degree | Ph.D. | en_US |
| dc.identifier.uri | http://hdl.handle.net/1853/26516 | |
| dc.publisher | Georgia Institute of Technology | en_US |
| dc.subject | Claw-free | en_US |
| dc.subject | 3-connected | en_US |
| dc.subject | Long cycles | en_US |
| dc.subject.lcsh | Graph theory | |
| dc.subject.lcsh | Decomposition (Mathematics) | |
| dc.title | Approximating the circumference of 3-connected claw-free graphs | en_US |
| dc.type | Text | |
| dc.type.genre | Dissertation | |
| dspace.entity.type | Publication | |
| local.contributor.advisor | Yu, Xingxing | |
| local.contributor.corporatename | College of Sciences | |
| local.contributor.corporatename | School of Mathematics | |
| relation.isAdvisorOfPublication | 3b32a3b5-5417-4c47-8a35-79346368e87f | |
| relation.isOrgUnitOfPublication | 85042be6-2d68-4e07-b384-e1f908fae48a | |
| relation.isOrgUnitOfPublication | 84e5d930-8c17-4e24-96cc-63f5ab63da69 |
Files
Original bundle
1 - 1 of 1
- Name:
- bilinski_mark_200812_phd.pdf
- Size:
- 522 KB
- Format:
- Adobe Portable Document Format
- Description: