cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A327234 Smallest BII-number of a set-system with cut-connectivity n.

Original entry on oeis.org

0, 1, 4, 52, 2868
Offset: 0

Views

Author

Gus Wiseman, Sep 03 2019

Keywords

Comments

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system (finite set of finite nonempty sets) has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18. Elements of a set-system are sometimes called edges.
We define the cut-connectivity (A326786) of a set-system to be the minimum number of vertices that must be removed (along with any resulting empty edges) to obtain a disconnected or empty set-system, with the exception that a set-system with one vertex has cut-connectivity 1. Except for cointersecting set-systems (A326853), this is the same as vertex-connectivity (A327051).
Conjecture: a(n > 1) = A327373(n) = the BII-number of K_n.

Examples

			The sequence of terms together with their corresponding set-systems:
     0: {}
     1: {{1}}
     4: {{1,2}}
    52: {{1,2},{1,3},{2,3}}
  2868: {{1,2},{1,3},{2,3},{1,4},{2,4},{3,4}}
		

Crossrefs

The same for spanning edge-connectivity is A327147.
The cut-connectivity of the set-system with BII-number n is A326786(n).