Large triangle-free subgraphs in graphs withoutK 4
- 1 December 1986
- journal article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 2 (1) , 135-144
- https://doi.org/10.1007/bf01788087
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On universality of graphs with uniformly distributed edgesDiscrete Mathematics, 1986
- Rudiments of Ramsey TheoryCBMS Regional Conference Series in Mathematics, 1981
- Partition theory and its applicationsPublished by Cambridge University Press (CUP) ,1979
- The Ramsey property for graphs with forbidden complete subgraphsJournal of Combinatorial Theory, Series B, 1976
- On a bound of Graham and Spencer for a graph-coloring constantJournal of Combinatorial Theory, Series B, 1973
- Graphs with Monochromatic Complete Subgraphs in Every Edge ColoringSIAM Journal on Applied Mathematics, 1970
- On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagonJournal of Combinatorial Theory, 1968
- On Sets of Acquaintances and Strangers at any PartyThe American Mathematical Monthly, 1959
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952