Short proofs of some extremal results II
We prove several results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected together because in each case the relevant proofs are quite sh...
Auteurs principaux: | Conlon, D, Fox, J, Sudakov, B |
---|---|
Format: | Journal article |
Publié: |
Elsevier
2015
|
Documents similaires
-
Short Proofs of Some Extremal Results
par: Conlon, David, et autres
Publié: (2015) -
Extremal results in sparse pseudorandom graphs
par: Conlon, D, et autres
Publié: (2014) -
RAMSEY-TYPE RESULTS FOR SEMI-ALGEBRAIC RELATIONS
par: Conlon, D, et autres
Publié: (2014) -
Extremal results in sparse pseudorandom graphs
par: Conlon, David, et autres
Publié: (2015) -
On two problems in graph Ramsey theory
par: Conlon, D, et autres
Publié: (2012)