ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected undirected simple graph with at least 33 vertices, and let U⊆V(G)U\subseteq V(G). Define the UU-nucleus complex by

ΔUG={E(G)∖E(N):N∈N(G), U⊆V(N)},\Delta^{G}_{U}=\{E(G)\setminus E(N):N\in\mathcal{N}(G),\ U\subseteq V(N)\},

where N(G)\mathcal{N}(G) is the set of nuclei of GG. Dorpalen-Barry et al.'s homology conjecture. The reduced homology group H~k(ΔUG;R)\tilde{H}_k(\Delta^{G}_{U};\mathbb{R}) is nonzero only if either U=∅U=\emptyset and k=∣E(G)∣−∣V(G)∣−1k=|E(G)|-|V(G)|-1, or ∣U∣>1|U|>1 and k=∣E(G)∣−∣V(G)∣k=|E(G)|-|V(G)|. This conjecture concerns the homological concentration of the complexes used to prove Elser's conjecture; the supplied source describes it as a conjecture posed by Dorpalen-Barry et al., while the present paper's abstract says that it is proved there.

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.