Limits, Regularity and Removal for Relational and Weighted Structures
The Szemeredi Regularity Lemma states that any graph can be well-approximated by graphs that are almost random. A well-known application of the Szemeredi Regularity Lemma is in the proof of the Removal Lemma for graphs. There are several extensions of the Regularity Lemma to hypergraphs. Our work bu...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Research Showcase @ CMU
2012
|
| Subjects: | |
| Online Access: | http://repository.cmu.edu/dissertations/144 http://repository.cmu.edu/cgi/viewcontent.cgi?article=1144&context=dissertations |