
Description
This paper focuses on the Szemerédi regularity lemma, a result in the field of extremal graph theory. The lemma says that every graph can be partitioned into bounded equal parts such that most edges of the graph span these partitions, and these edges are distributed in a fairly uniform way.
Download count: 0
Details
Contributors
- Byrne, Michael John (Author)
- Czygrinow, Andrzej (Thesis director)
- Kierstead, Hal (Committee member)
- Barrett, The Honors College (Contributor)
- School of Mathematical and Statistical Sciences (Contributor)
- Department of Chemistry and Biochemistry (Contributor)
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
2015-05
Subjects
Resource Type
Collections this item is in