Minimizing the number of matchings of fixed size in a \(K_s\)-saturated graph

For a fixed graph \(F\), a graph \(G\) is said to be \(F\)-saturated if \(G\) does not contain a subgraph isomorphic to \(F\) but does contain \(F\) after the addition of any new edge. Let \(M_k\) be a matching consisting of \(k\) edges and \(S_{n,k}\) be the join graph of a complete graph \(K_k\) a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2022-11
Hauptverfasser:	Feng, Jiejing, Doudou Hei, Hou, Xinmin
Format:	Artikel
Sprache:	eng
Schlagworte:	Edge joints Graph theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!