ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every fixed integer k≥2k\ge 2, there exists a constant CkC_k such that every graph GG on nn vertices with at least CknC_k n edges contains pairwise edge-disjoint cycles C1,…,CkC_1,\ldots,C_k satisfying V(Ck)⊆⋯⊆V(C1)V(C_k)\subseteq\cdots\subseteq V(C_1), and such that, for each i∈{1,…,k−1}i\in\{1,\ldots,k-1\}, the cyclic order induced by CiC_i on V(Ci+1)V(C_{i+1}) agrees with the cyclic order induced by Ci+1C_{i+1}, up to reversal.

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.