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?

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Open the source record
Where the source files it280 share a topic
Graph Theory275Chromatic Number61
None carries a Standing. Browse the topic.
Start workOpen sources