The extremality of 2-partite Turán graphs with respect to the number of colorings

Author(s)Fuentes, Melissa M.
Date Accessioned2021-11-30T15:10:31Z
Date Available2021-11-30T15:10:31Z
Publication Date2021
SWORD Update2021-08-09T22:12:19Z
AbstractLet 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
AdvisorLazebnik, Felix
DegreePh.D.
DepartmentUniversity of Delaware, Department of Mathematical Sciences
DOIhttps://doi.org/10.58088/jx6c-ka90
Unique Identifier1286678221
URLhttps://udspace.udel.edu/handle/19716/29449
Languageen
PublisherUniversity of Delawareen_US
URIhttps://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
KeywordsColoringsen_US
KeywordsExtremal graphen_US
KeywordsExtremal graph theoryen_US
KeywordsGraph theoryen_US
KeywordsTurán graphen_US
TitleThe extremality of 2-partite Turán graphs with respect to the number of coloringsen_US
TitleThe extremality of two-partite Turán graphs with respect to the number of coloringsen_US
TitleThe extremality of bi-partite Turán graphs with respect to the number of coloringsen_US
TypeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Fuentes_udel_0060D_14553.pdf
Size:
560.03 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.22 KB
Format:
Item-specific license agreed upon to submission
Description: