ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph of order at least three, and write ω(G∖S)\omega(G\setminus S) for the number of components of G∖SG\setminus S. A connected 2,4\\{2,4\\}-factor is a connected spanning subgraph whose vertex degrees all belong to 2,4\\{2,4\\}. The connected 2,4\\{2,4\\}-factor conjecture. If

ω(G∖S)≤12∣S∣+1\omega(G\setminus S)\leq \frac{1}{2}|S|+1

for every S⊆V(G)S\subseteq V(G), then GG admits a connected 2,4\\{2,4\\}-factor. The source states that this would simplify the preceding theorem, notes that it is true for strongly 22-tough graphs, and gives a restricted case in which it can be confirmed.

Record

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.