Journal article
Short proofs of some extremal results II
- Abstract:
- 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 short.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 340.4KB)
-
- Publisher copy:
- 10.1016/j.jctb.2016.03.005
Authors
Bibliographic Details
- Publisher:
- Elsevier Publisher's website
- Journal:
- Journal of Combinatorial Theory. Series B Journal website
- Volume:
- 121
- Pages:
- 173-196
- Publication date:
- 2015-07-02
- DOI:
- EISSN:
-
1096-0902
- ISSN:
-
0095-8956
Item Description
- Keywords:
- Pubs id:
-
pubs:618318
- UUID:
-
uuid:6d19bc4b-482b-4e9f-85db-789d6f5e6ffd
- Local pid:
- pubs:618318
- Source identifiers:
-
618318
- Deposit date:
- 2016-04-29
Terms of use
- Copyright holder:
- Elsevier Inc
- Copyright date:
- 2015
- Notes:
-
This is an
accepted manuscript of a journal article published by Elsevier in Journal of Combinatorial Theory, Series B on 2016-04-06, available online: http://dx.doi.org/10.1016/j.jctb.2016.03.005
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record