Randomly H-coverable graphs (Q792344): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:14, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Randomly H-coverable graphs |
scientific article |
Statements
Randomly H-coverable graphs (English)
0 references
1985
0 references
A graph is randomly matchable if every matching of the graph is contained in a perfect matching. We generalize this notion and say that a graph G is randomly H-coverable if every set of independent subgraphs, each isomorphic to H, that does not cover the vertices of G can be extended to a larger set of independent copies of H. Various problems are considered for the situation where H is a path. In particular, we characterize the graphs that are randomly \(P_ 3\)-coverable.
0 references
randomly matchable
0 references
perfect matching
0 references
independent subgraphs
0 references