A note on directed 4-cycles in digraphs

Details A note on directed 4-cycles in digraphs A note on directed 4-cycles in digraphs

2012-04-20

arxiv.org/abs/1204.4515v1

Mathematics

Combinatorics

Scientific paper

Using some combinatorial techniques, in this note, it is proved that if
$\alpha\geq 0.28866$, then any digraph on $n$ vertices with minimum outdegree
at least $\alpha n$ contains a directed cycle of length at most 4.

Affiliated with

Also associated with

No associations

Rating

A note on directed 4-cycles in digraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on directed 4-cycles in digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on directed 4-cycles in digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-5152