Skip to content

Erdős problem 128

Start work

Let G be a graph with n vertices such that every induced subgraph on ≥ n/2n/2 vertices has more than n2/50n^2/50 edges. Must G contain a triangle?

Erdős Problems records this as falsifiable.

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutionfalsifiable
  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