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...
Huvudupphovsmän: | Conlon, D, Fox, J, Sudakov, B |
---|---|
Materialtyp: | Journal article |
Publicerad: |
Elsevier
2015
|
Liknande verk
Liknande verk
-
Short Proofs of Some Extremal Results
av: Conlon, David, et al.
Publicerad: (2015) -
Extremal results in sparse pseudorandom graphs
av: Conlon, D, et al.
Publicerad: (2014) -
RAMSEY-TYPE RESULTS FOR SEMI-ALGEBRAIC RELATIONS
av: Conlon, D, et al.
Publicerad: (2014) -
Extremal results in sparse pseudorandom graphs
av: Conlon, David, et al.
Publicerad: (2015) -
On two problems in graph Ramsey theory
av: Conlon, D, et al.
Publicerad: (2012)