The f-Factor Problem for Graphs and the Hereditary Property

Details The f-Factor Problem for Graphs and the Hereditary Property The f-Factor Problem for Graphs and the Hereditary Property

2004-04-08

arxiv.org/abs/math/0404179v1

Mathematics

Logic

Scientific paper

If P is a hereditary property then we show that, for the existence of a
perfect f-factor, P is a sufficient condition for countable graphs and yields a
sufficient condition for graphs of size aleph_1. Further we give two examples
of a hereditary property which is even necessary for the existence of a perfect
f-factor. We also discuss the aleph_2-case.

Affiliated with

Also associated with

No associations

Rating

The f-Factor Problem for Graphs and the Hereditary Property 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 The f-Factor Problem for Graphs and the Hereditary Property, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The f-Factor Problem for Graphs and the Hereditary Property will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-158669