Extremal results in sparse pseudorandom graphs
Szemeredi's regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and Rodl proved an analogue of Szemeredi's regularity lemma for sparse graphs as part of a general program toward e...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Elsevier
2015
|
| Online Access: | http://hdl.handle.net/1721.1/92845 |