Skip to content

Erdős problem 584

Must every graph with nn vertices and δn2\delta n^2 edges contain large subgraphs in which every two edges lie on specified short cycles? A dense high-girth construction refutes the statement when δ\delta may shrink with nn.

Nothing has been recorded here yet.

How far the record reaches2 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. FormalNone associated
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingFormal declaration

No formal declaration is associated with this question.

A formal statement is the first thing a check can run against.

Where the source files it274 share a topic
None carries a Standing. Browse the topic.