ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let the graphs G=(V,E)G=(V,E) and HH be fixed. An edge set F⊆EF\subseteq E is called HH-free if (V,F)(V,F) does not contain HH as a subgraph. We say that FF is strongly maximal if for any HH-free edge set I⊆EI\subseteq E we have ∣I∖F∣≤∣F∖I∣\left|I \setminus F\right| \leq \left|F \setminus I\right|. If HH is the path of length two, then we talk about strongly maximal matchings, and any GG admits such a matching ( p. 16. Theorem 5.6). For what other graphs HH can we guarantee the existence of a strongly maximal HH-free FF for any GG?

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.