High degree graphs contain large-star factors

Details High degree graphs contain large-star factors High degree graphs contain large-star factors

2008-10-11

arxiv.org/abs/0810.2053v1

Mathematics

Combinatorics

Scientific paper

We show that any finite simple graph with minimum degree $d$ contains a
spanning star forest in which every connected component is of size at least
$\Omega((d/\log d)^{1/3})$. This settles a problem of J. Kratochvil.

Affiliated with

Also associated with

No associations

Rating

High degree graphs contain large-star factors 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 High degree graphs contain large-star factors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High degree graphs contain large-star factors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-200188