Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

GC

2008

Springer

2008

Springer

For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed cycles. Let (G) be the number of unordered pairs of vertices of G which are not adjacent. We prove that every directed graph whose shortest directed cycle has length at least r 4 satisfies (G) c(G)/r2 , where c is an absolute constant. This is tight up to the constant factor and extends a result of Chudnovsky, Seymour, and Sullivan. This result can be also used to answer a question of Yuster concerning almost given length cycles in digraphs. We show that for any fixed 0 < < 1/2 and sufficiently large n, if G is a digraph with n vertices and (G) n2 , then for any 0 m n - o(n) it contains a directed cycle whose length is between m and m + 6-1/2 . Moreover, there is a constant C such that either G contains directed cycles of every length between C and n - o(n) or it is close to a digraph G with a si...

Added |
10 Dec 2010 |

Updated |
10 Dec 2010 |

Type |
Journal |

Year |
2008 |

Where |
GC |

Authors |
Raphael Yuster |

Comments (0)