Strongly maximal H-free spanning subgraph
Statement
Let the graphs and be fixed. An edge set is called -free if does not contain as a subgraph. We say that is strongly maximal if for any -free edge set we have . If is the path of length two, then we talk about strongly maximal matchings, and any admits such a matching ( p. 16. Theorem 5.6). For what other graphs can we guarantee the existence of a strongly maximal -free for any ?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.