Induced Saturation Number

Details Induced Saturation Number Induced Saturation Number

2011-12-08

arxiv.org/abs/1112.1923v1

Mathematics

Combinatorics

14 pages, 7 figures

Scientific paper

In this paper, we discuss a generalization of the notion of saturation in graphs in order to deal with induced structures. In particular, we define ${\rm indsat}(n,H)$, which is the fewest number of gray edges in a trigraph so that no realization of that trigraph has an induced copy of $H$, but changing any white or black edge to gray results in some realization that does have an induced copy of $H$. We give some general and basic results and then prove that ${\rm indsat}(n,P_4)=\lceil (n+1)/3\rceil$ for $n\geq 4$ where $P_4$ is the path on 4 vertices. We also show how induced saturation in this setting extends to a natural notion of saturation in the context of general Boolean formulas.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-549218