ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G\mathscr G be a family of graphs. It is stable if there exist positive constants δ=δ(G)\delta=\delta(\mathscr G), γ=γ(G)\gamma=\gamma(\mathscr G), and n(G)n(\mathscr G) such that, for every graph G∈GG\in\mathscr G with at least n(G)n(\mathscr G) vertices and mm edges, a positive fraction of all subgraphs of GG with (1−δ)m(1-\delta)m edges has crossing number at least γcr⁡(G)\gamma\operatorname{cr}(G). Equivalently, if G′G' is obtained from GG by deleting each edge independently with probability δ\delta, then with high probability cr⁡(G′)≥γcr⁡(G)\operatorname{cr}(G')\geq\gamma\operatorname{cr}(G).

Černý–Kynčl–Tóth dense stability conjecture. There exists an ϵ‾∈(1/3,1)\overline{\epsilon}\in(1/3,1) such that, for each ϵ∈(ϵ‾,1]\epsilon\in(\overline{\epsilon},1], the family of graphs with Θ(n1+ϵ)\Theta(n^{1+\epsilon}) edges is stable.

The original all-ϵ\epsilon stability conjecture was disproved for ϵ≤1/3\epsilon\leq 1/3. This restricted conjecture remains open for denser graph families, and concerns the robustness of crossing numbers under random edge deletion.

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.