Date of Original Version

2010

Type

Article

Rights Management

© by International Press of Boston

Abstract or Description

The random greedy algorithm for constructing partial Steiner-Triple-System is defined as follows.We begin with a complete graph on n vertices and proceed to remove the edges of triangles one at a time, where each triangle removed is chosen uniformly at random from the collection of all remaining triangles.This stochastic process terminates once it arrives at a triangle-free graph.In this note we show that with high probability the number of edges in the final graph is at most n7/4+o(1).

DOI

10.4310/JOC.2010.v1.n4.a5

Included in

Mathematics Commons

Share

COinS
 

Published In

Journal of Combinitorics, 1, 4, 477-488.