Induced saturation number

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 w...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete mathematics 2012-11, Vol.312 (21), p.3096-3106
Hauptverfasser:	Martin, Ryan R., Smith, Jason J.
Format:	Artikel
Sprache:	eng
Schlagworte:	Boolean algebra Boolean formulas Graphs Induced subgraphs Mathematical analysis Reproduction Saturation Trigraphs
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!