ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with nn vertices and δn2\delta n^{2} edges. Are there subgraphs H1,H2⊆GH_1,H_2\subseteq G such that

  • H1H_1 has ≫δ3n2\gg \delta^3n^2 edges and every two edges in H1H_1 are contained in a cycle of length at most 66, and furthermore if two edges share a vertex they are on a cycle of length 44, and

  • H2H_2 has ≫δ2n2\gg \delta^2n^2 edges and every two edges in H2H_2 are contained in a cycle of length at most 88.

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.