[go: up one dir, main page]

login
Revision History for A372171 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of labeled simple graphs covering n vertices with a unique triangle.
(history; published version)
#9 by Michel Marcus at Thu Aug 01 01:21:00 EDT 2024
STATUS

reviewed

approved

#8 by Joerg Arndt at Thu Aug 01 01:03:55 EDT 2024
STATUS

proposed

reviewed

#7 by Andrew Howroyd at Thu Aug 01 00:34:14 EDT 2024
STATUS

editing

proposed

#6 by Andrew Howroyd at Thu Aug 01 00:24:08 EDT 2024
DATA

0, 0, 0, 1, 12, 220, 5460, 191975, 9596160, 683389812, 69270116040

EXTENSIONS

a(7)-a(10) from Andrew Howroyd, Aug 01 2024

STATUS

approved

editing

#5 by Michael De Vlieger at Wed Apr 24 08:47:57 EDT 2024
STATUS

proposed

approved

#4 by Gus Wiseman at Wed Apr 24 06:23:20 EDT 2024
STATUS

editing

proposed

#3 by Gus Wiseman at Wed Apr 24 06:23:16 EDT 2024
EXAMPLE

12-,13-,14-,23

12-,13-,14-,24

12-,13-,14-,34

12-,13-,23-,24

12-,13-,23-,34

12-,14-,23-,24

12-,14-,24-,34

12-,23-,24-,34

13-,14-,23-,34

13-,14-,24-,34

13-,23-,24-,34

14-,23-,24-,34

CROSSREFS

A372192 counts unlabeled graphs with a unique cycle, covering A372191.

Cf. A000272, A053530, A121251, `A137916, A367868, A369199, A372191.

#2 by Gus Wiseman at Wed Apr 24 04:58:32 EDT 2024
NAME

allocated for Gus WisemanNumber of labeled simple graphs covering n vertices with a unique triangle.

DATA

0, 0, 0, 1, 12, 220, 5460

OFFSET

0,5

COMMENTS

The unlabeled version is A372174.

FORMULA

Inverse binomial transform of A372172.

EXAMPLE

The a(4) = 12 graphs:

12-13-14-23

12-13-14-24

12-13-14-34

12-13-23-24

12-13-23-34

12-14-23-24

12-14-24-34

12-23-24-34

13-14-23-34

13-14-24-34

13-23-24-34

14-23-24-34

MATHEMATICA

cys[y_]:=Select[Subsets[Union@@y, {3}], MemberQ[y, {#[[1]], #[[2]]}] && MemberQ[y, {#[[1]], #[[3]]}] && MemberQ[y, {#[[2]], #[[3]]}]&];

Table[Length[Select[Subsets[Subsets[Range[n], {2}]], Union@@#==Range[n]&&Length[cys[#]]==1&]], {n, 0, 5}]

CROSSREFS

Column k = 1 of A372167, unlabeled A372173.

For no triangles we have A372168 (non-covering A213434), unlabeled A372169.

The non-covering case is A372172, unlabeled A372194.

The unlabeled version is A372174.

For all cycles (not just triangles) we have A372195, non-covering A372193.

A001858 counts acyclic graphs, unlabeled A005195.

A006125 counts simple graphs, unlabeled A000088.

A006129 counts covering graphs, unlabeled A002494

A054548 counts labeled covering graphs by edges, unlabeled A370167.

A105784 counts acyclic covering graphs, unlabeled A144958.

A372170 counts graphs by triangles, unlabeled A263340.

A372175 counts covering graphs by cycles, non-covering A372176.

A372192 counts unlabeled graphs with a unique cycle, covering A372191.

Cf. A000272, A053530, A121251, `A137916, A367868, A369199.

KEYWORD

allocated

nonn,more

AUTHOR

Gus Wiseman, Apr 24 2024

STATUS

approved

editing

#1 by Gus Wiseman at Sun Apr 21 04:42:40 EDT 2024
NAME

allocated for Gus Wiseman

KEYWORD

allocated

STATUS

approved