Universal graphs with a forbidden subtree

Details Universal graphs with a forbidden subtree Universal graphs with a forbidden subtree

2005-12-10

arxiv.org/abs/math/0512218v1

Mathematics

Logic

Scientific paper

We show that the problem of the existence of universal graphs with specified
forbidden subgraphs can be systematically reduced to certain critical cases by
a simple pruning technique which simplifies the underlying structure of the
forbidden graphs, viewed as trees of blocks. As an application, we characterize
the trees T for which a universal countable T-free graph exists.

Affiliated with

Also associated with

No associations

Rating

Universal graphs with a forbidden subtree 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 Universal graphs with a forbidden subtree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal graphs with a forbidden subtree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-322645