The extremality of 2-partite Turán graphs with respect to the number of colorings
| Author(s) | Fuentes, Melissa M. | |
| Date Accessioned | 2021-11-30T15:10:31Z | |
| Date Available | 2021-11-30T15:10:31Z | |
| Publication Date | 2021 | |
| SWORD Update | 2021-08-09T22:12:19Z | |
| Abstract | Let Tr(n) denote the Turán graph -- the complete r-partite graph on n vertices with partition sizes as equal as possible. The number of edges of Tr(n) is denoted by tr(n). For a simple graph G and a positive integer q, let PG(q) denote the number of proper vertex colorings of G with at most q colors. We prove that for q ∈ {5, 7} and sufficiently large n, PG(q) ≤ PT2(n)(q) for any graph G with n vertices and t2(n) edges, with equality holding if and only if G = T2(n). | en_US |
| Advisor | Lazebnik, Felix | |
| Degree | Ph.D. | |
| Department | University of Delaware, Department of Mathematical Sciences | |
| DOI | https://doi.org/10.58088/jx6c-ka90 | |
| Unique Identifier | 1286678221 | |
| URL | https://udspace.udel.edu/handle/19716/29449 | |
| Language | en | |
| Publisher | University of Delaware | en_US |
| URI | https://login.udel.idm.oclc.org/login?url=https://www.proquest.com/dissertations-theses/extremality-2-partite-turán-graphs-with-respect/docview/2572623204/se-2?accountid=10457 | |
| Keywords | Colorings | en_US |
| Keywords | Extremal graph | en_US |
| Keywords | Extremal graph theory | en_US |
| Keywords | Graph theory | en_US |
| Keywords | Turán graph | en_US |
| Title | The extremality of 2-partite Turán graphs with respect to the number of colorings | en_US |
| Title | The extremality of two-partite Turán graphs with respect to the number of colorings | en_US |
| Title | The extremality of bi-partite Turán graphs with respect to the number of colorings | en_US |
| Type | Thesis | en_US |