Skip to content

Erdős problem 740

Start work

Let m\mathfrak{m} be an infinite cardinal and GG be a graph with chromatic number m\mathfrak{m}. Let r≥1r\geq 1. Must GG contain a subgraph of chromatic number m\mathfrak{m} which does not contain any odd cycle of length ≤r\leq r?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:32129a388ad24b8b486d838ca168c5b0b9537485f0e2a5232e2ccaa79c3239ce
Metadata
sha256:c8f7ebf51582dcd7af88108fc2753575d251210c5840860a5b870e401b54284a
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:bf090ac350f047119c734b41007595560437be041f24d8d9ada1bd1a65937e89
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON