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...
Autors principals: | Conlon, D, Fox, J, Sudakov, B |
---|---|
Format: | Journal article |
Publicat: |
Elsevier
2015
|
Ítems similars
-
Short Proofs of Some Extremal Results
per: Conlon, David, et al.
Publicat: (2015) -
Extremal results in sparse pseudorandom graphs
per: Conlon, D, et al.
Publicat: (2014) -
RAMSEY-TYPE RESULTS FOR SEMI-ALGEBRAIC RELATIONS
per: Conlon, D, et al.
Publicat: (2014) -
Extremal results in sparse pseudorandom graphs
per: Conlon, David, et al.
Publicat: (2015) -
On two problems in graph Ramsey theory
per: Conlon, D, et al.
Publicat: (2012)