ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Does every graph GG with chromatic number at least ℵ1\aleph_1 contain all sufficiently large odd cycles? Equivalently, for every vertex type VV and every simple graph GG on VV, if GG has no proper coloring with the countable set of colors N\mathbb N, then there exists N∈NN\in\mathbb N such that for every k∈Nk\in\mathbb N with N≤kN\leq k, there are a vertex v∈Vv\in V and a cycle of GG based at vv whose length is 2k+12k+1.

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.