A schedule S is conflict serializable if and only if its precedence graph is

**The standard theorem:** conflict serializable iff acyclic precedence graph. A cycle would mean two transactions each must precede the other in any equivalent serial order, which is impossible. Acyclic graphs have a topological order that gives a valid serial equivalent. Completeness, connectedness and tree-ness are unrelated properties.