erdős #765

← #764 · #766 → (packet.json; erdosproblems.com)

Give an asymptotic formula for .

claimed — no verifier run, no signed judgmentunreviewedOpen. Worked here; no verified result yet.

graph theory · solved · 0 attempts

Check This Result Yourself

use this data

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

OEIS1

A006855 — Maximum number of edges in an n-node squarefree graph, or, in a graph containing no 4-cycle, or no C_4.0,1,3,4,6,7,9,11,13,16,18,21,24,27,30,33,36,39,42,46,50,52,56,59,63,67,71,76,80,85,90,92,96,102,106,110,113,117,122,127

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Verify this yourself

Run this command — the output must match these fingerprints.

vela reproduce examples/erdos-problems
  • packet.json · sha256 3e1848409e66b6a127d4b6379c34e615e6f475b507146a5249b213662d1147da

Search Vela

Search problems, results, contributors, and pages — or jump straight to an id.