The Electronic Journal of Combinatorics · 1994 · 28 citations · 0 references
Natural SciencesMathematicsColor TheoryCombinatoricsGraph VisualizationGraph AlgorithmsGraph ColoringGraph TheoryRamsey TheoryRamsey GraphsRamsey Minimal GraphsRamsey PropertyRamsey's Theorem
An elementary probabilistic argument is presented which shows that for every forest $F$ other than a matching, and every graph $G$ containing a cycle, there exists an infinite number of graphs $J$ such that $J\to (F,G)$ but if we delete from $J$ any edge $e$ the graph $J-e$ obtained in this way does not have this property.