Orientation Ramsey thresholds for cycles and cliques

Abstract: If

G

is a graph and

v e c H

is an oriented graph, we write

G o v e c H

to say that every orientation of the edges of

G

contains

v e c H

as a subdigraph. We consider the case in which

G = G (n, p)

, the binomial random graph. We determine the threshold

p_{v e c H} = p_{v e c H} (n)

for the property

G (n, p) o v e c H

for the cases in which

v e c H

is an acyclic orientation of a complete graph or of a cycle.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Orientation Ramsey thresholds for cycles and cliques