Short proofs of some extremal results II
Preprint
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.Keywords
All Related Versions
This publication has 33 references indexed in Scilit:
- Dependent random choiceRandom Structures & Algorithms, 2010
- Density theorems for bipartite graphs and related Ramsey-type resultsCombinatorica, 2009
- The Extremal Function for Complete MinorsJournal of Combinatorial Theory, Series B, 2001
- On graphs with linear Ramsey numbersJournal of Graph Theory, 2000
- On the number of copies of one hypergraph in anotherIsrael Journal of Mathematics, 1998
- Extremal problems concerning transformations of the edges of the complete hypergraphsJournal of Graph Theory, 1987
- Lower bound of the hadwiger number of graphs by their average degreeCombinatorica, 1984
- On the number of subgraphs of prescribed type of graphs with a given number of edgesIsrael Journal of Mathematics, 1981
- Homomorphieeigenschaften und mittlere Kantendichte von GraphenMathematische Annalen, 1967
- On extremal problems of graphs and generalized graphsIsrael Journal of Mathematics, 1964