Abstract
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 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 indsat(n,P4)=⌈(n+1)/3⌉ for n≥4 where P4 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
