Skip to content

Erdős problem 1080

Start work

Let GG be a bipartite graph on nn vertices such that one part has ⌊n2/3⌋\lfloor n^{2/3}\rfloor vertices. Is there a constant c>0c>0 such that if GG has at least cncn edges then GG must contain a C6C_6?

Erdős Problems records this as disproved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutiondisproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it274 share a topic
Graph Theory275
None carries a Standing. Browse the topic.
Start workOpen sources