|
|
|
|
| LEADER |
01418 am a22002653u 4500 |
| 001 |
92861 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Conlon, David
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Mathematics
|e contributor
|
| 100 |
1 |
0 |
|a Fox, Jacob
|e contributor
|
| 700 |
1 |
0 |
|a Fox, Jacob
|e author
|
| 700 |
1 |
0 |
|a Sudakov, Benny
|e author
|
| 245 |
0 |
0 |
|a Short Proofs of Some Extremal Results
|
| 260 |
|
|
|b Cambridge University Press,
|c 2015-01-14T18:13:00Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/92861
|
| 520 |
|
|
|a We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because in each case the relevant proofs are quite short.
|
| 520 |
|
|
|a Royal Society (Great Britain) (University Research Fellowship)
|
| 520 |
|
|
|a Simons Foundation (Fellowship)
|
| 520 |
|
|
|a National Science Foundation (U.S.) (Grant DMS-1069197)
|
| 520 |
|
|
|a National Science Foundation (U.S.) (Grant DMS-1101185)
|
| 520 |
|
|
|a United States. Army Research Office. Multidisciplinary University Research Initiative (grant FA9550-10-1-0569)
|
| 520 |
|
|
|a United States-Israel Binational Science Foundation (grant)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Combinatorics, Probability and Computing
|
