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...
Main Authors: | Conlon, D, Fox, J, Sudakov, B |
---|---|
פורמט: | Journal article |
יצא לאור: |
Elsevier
2015
|
פריטים דומים
-
Short Proofs of Some Extremal Results
מאת: Conlon, David, et al.
יצא לאור: (2015) -
Extremal results in sparse pseudorandom graphs
מאת: Conlon, D, et al.
יצא לאור: (2014) -
RAMSEY-TYPE RESULTS FOR SEMI-ALGEBRAIC RELATIONS
מאת: Conlon, D, et al.
יצא לאור: (2014) -
Extremal results in sparse pseudorandom graphs
מאת: Conlon, David, et al.
יצא לאור: (2015) -
On two problems in graph Ramsey theory
מאת: Conlon, D, et al.
יצא לאור: (2012)