Erdős problem 128Let 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?WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 1282 retained source recordsCanvaspublic previewSource#128→ResultNone→Checks0