ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a hypergraph. A strongly maximal matching is a matching F⊆E(H)F \subseteq E(H) so that ∣F′∖F∣≤∣F∖F′∣|F' \setminus F| \le |F \setminus F'| for every matching F′F'. A strongly minimal cover is a (vertex) cover X⊆V(H)X \subseteq V(H) so that ∣X′∖X∣≥∣X∖X′∣|X' \setminus X| \ge |X \setminus X'| for every cover X′X'.

Conjecture If HH is a (possibly infinite) hypergraph in which all edges have size ≤k\le k for some integer kk, then HH has a strongly maximal matching and a strongly minimal cover.

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.