A Pedagogical Approach to Ramsey Multiplicity
dc.contributor.advisor | Gasarch, William | en_US |
dc.contributor.author | Brady, Robert | en_US |
dc.contributor.department | Computer Science | en_US |
dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
dc.date.accessioned | 2024-02-10T06:43:19Z | |
dc.date.available | 2024-02-10T06:43:19Z | |
dc.date.issued | 2023 | en_US |
dc.description.abstract | It is well known that for all 2-colorings of the edges of $K_6$ there is amonochromatic triangle. Less well known is that there are two monochromatic triangles. More generally, for all 2-colorings of the edges of $K_n$ there are roughly $\ge n^3/24$ monochromatic triangles. Another way to state this is that the density of monochromatic triangles is at least $1/4$. The Ramsey Multiplicity of $k$ is (asymptotically) the greatest $\alpha$ such that for every coloring of $K_n$ the density of monochromatic $K_k$'s is $\alpha$. This concept has been studied for many years. We survey the area and provide proofs that are more complete, more motivated, and using modern notation. | en_US |
dc.identifier | https://doi.org/10.13016/dspace/5b6r-ejqq | |
dc.identifier.uri | http://hdl.handle.net/1903/31701 | |
dc.language.iso | en | en_US |
dc.subject.pqcontrolled | Computer science | en_US |
dc.subject.pqcontrolled | Mathematics | en_US |
dc.subject.pqcontrolled | Theoretical mathematics | en_US |
dc.subject.pquncontrolled | graph-coloring | en_US |
dc.subject.pquncontrolled | pedagogy | en_US |
dc.subject.pquncontrolled | theory | en_US |
dc.title | A Pedagogical Approach to Ramsey Multiplicity | en_US |
dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Brady_umd_0117N_23596.pdf
- Size:
- 477.08 KB
- Format:
- Adobe Portable Document Format