Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp01ks65hg39d
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Seymour, Paul | - |
dc.contributor.author | Pagano, Vincent | - |
dc.date.accessioned | 2022-07-29T14:46:51Z | - |
dc.date.available | 2022-07-29T14:46:51Z | - |
dc.date.created | 2022-04-25 | - |
dc.date.issued | 2022-07-29 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp01ks65hg39d | - |
dc.description.abstract | Given a graph H, we say that H has the Erdos-Hajnal property if there exists a constant τ > 0 such that every H-free graph G contains a clique or a stable set of size at least |G| τ . The question of whether or not all graphs have this property has remained unsolved for over thirty years, and there has been a rapidly expanding body of literature on the subject (see, e.g., [1], [7], [8], [18], [28], [37]). Recently, Maria Chudnovsky, Alex Scott, Paul Seymour, and Sophie Spirkl [13] verified the Erd˝os-Hajnal conjecture for H = C5, which has been regarded as case of particular interest by many (see, e.g., [2]). This thesis will be detailing the most recent results about this conjecture as well as its potential directions moving forward. | en_US |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en_US |
dc.title | On the Existence of Polynomially Large Cliques or Stable Sets in H-free Graphs | en_US |
dc.type | Princeton University Senior Theses | |
pu.date.classyear | 2022 | en_US |
pu.department | Mathematics | en_US |
pu.pdf.coverpage | SeniorThesisCoverPage | |
pu.contributor.authorid | 920209664 | |
pu.mudd.walkin | No | en_US |
Appears in Collections: | Mathematics, 1934-2023 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
PAGANO-VINCENT-THESIS.pdf | 377.56 kB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.