Erdős’s nested-cycle problem
Statement
For every fixed integer , there exists a constant such that every graph on vertices with at least edges contains pairwise edge-disjoint cycles satisfying , and such that, for each , the cyclic order induced by on agrees with the cyclic order induced by , up to reversal.
Record
- Added
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.