A density result for random sparse oriented graphs and its relation to a conjecture of Woodall.

Donadelli, Jair; Kohayakawa, Yoshiharu

Displaying similar documents to “A density result for random sparse oriented graphs and its relation to a conjecture of Woodall.”

A note on sparse random graphs and cover graphs.

Bohmann, Tom, Frieze, Alan, Ruszinkó, Miklós, Thoma, Lubos (2000)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Voltage graphs, group presentations and cages.

Exoo, Geoffrey (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The cycle-complete graph Ramsey number r(C₅,K₇)

Ingo Schiermeyer (2005)

Discussiones Mathematicae Graph Theory

Similarity:

The cycle-complete graph Ramsey number r(Cₘ,Kₙ) is the smallest integer N such that every graph G of order N contains a cycle Cₘ on m vertices or has independence number α(G) ≥ n. It has been conjectured by Erdős, Faudree, Rousseau and Schelp that r(Cₘ,Kₙ) = (m-1)(n-1)+1 for all m ≥ n ≥ 3 (except r(C₃,K₃) = 6). This conjecture holds for 3 ≤ n ≤ 6. In this paper we will present a proof for r(C₅,K₇) = 25.