Michael Sollami has authored 8 sequences.
A207408
Number of connected triangle-free graphs on n nodes with edge chromatic number 3.
Original entry on oeis.org
0, 0, 0, 1, 4, 12, 27, 84, 212, 694, 2105, 7354, 25469, 95631, 364957
Offset: 1
A207412
Number of connected triangle-free graphs on n nodes with edge chromatic number 6.
Original entry on oeis.org
0, 0, 0, 0, 0, 0, 1, 6, 57, 659, 10236, 204927, 5231080, 166394885, 6459372691
Offset: 1
A207411
Number of connected triangle-free graphs on n nodes with edge chromatic number 5.
Original entry on oeis.org
0, 0, 0, 0, 0, 1, 5, 38, 330, 3435, 41823, 614757, 10678281, 218040550, 5180904503
Offset: 1
A207410
Number of connected triangle-free graphs on n nodes with edge chromatic number 4.
Original entry on oeis.org
0, 0, 0, 0, 1, 4, 25, 136, 772, 4953, 35340, 288335, 2632792, 26726855, 296550560
Offset: 1
A205578
Number of n-node simple graphs having clique number 9.
Original entry on oeis.org
0, 0, 0, 0, 0, 0, 0, 0, 1, 9, 221, 14838, 3273685
Offset: 1
A205567
Number of 8-chromatic (i.e., chromatic number equals 8) simple graphs on n nodes.
Original entry on oeis.org
0, 0, 0, 0, 0, 0, 0, 1, 8, 165, 8214
Offset: 1
A205577
Number of n-node simple graphs having clique number 8.
Original entry on oeis.org
0, 0, 0, 0, 0, 0, 0, 1, 8, 164, 8165, 1184155, 462435257
Offset: 1
A205568
Number of 9-chromatic (i.e., chromatic number equals 9) simple graphs on n nodes.
Original entry on oeis.org
0, 0, 0, 0, 0, 0, 0, 0, 1, 9, 222
Offset: 1
Comments