ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C4={Ck ⁣:k≥4}\mathcal{C}_4=\{C_k\colon k\geq 4\}, and let ι(G,C4)\iota(G,\mathcal{C}_4) denote the maximum number of vertex-disjoint members of C4\mathcal{C}_4 in a graph GG. Problem 3 asks for the smallest real number cc, if it exists, such that there is a finite set E\mathcal{E} of graphs satisfying

ι(G,C4)≤c∣V(G)∣\iota(G,\mathcal{C}_4)\leq c\lvert V(G)\rvert

for every connected graph GG that is not an E\mathcal{E}-graph. One-fifth conjecture. The number cc in this problem is 1/51/5. This conjecture extends the bound for isolating squares in connected graphs to the family of cycles of length at least four, up to excluding a finite set of exceptional graphs; the surrounding text presents it as an open problem.

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.