Ramsey properties of random graphs
- 1 September 1992
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 56 (1) , 55-68
- https://doi.org/10.1016/0095-8956(92)90006-j
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Sparse color-critical hypergraphsCombinatorica, 1989
- Large triangle-free subgraphs in graphs withoutK 4Graphs and Combinatorics, 1986
- Limit theorems for complete subgraphs of random graphsPeriodica Mathematica Hungarica, 1979
- Graphs with Monochromatic Complete Subgraphs in Every Edge ColoringSIAM Journal on Applied Mathematics, 1970
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- On Sets of Acquaintances and Strangers at any PartyThe American Mathematical Monthly, 1959