login

Revision History for A327102

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
BII-numbers of set-systems with non-spanning edge-connectivity >= 2.
(history; published version)
#11 by N. J. A. Sloane at Fri Aug 23 14:15:35 EDT 2019
STATUS

proposed

approved

#10 by Gus Wiseman at Fri Aug 23 11:02:05 EDT 2019
STATUS

editing

proposed

#9 by Gus Wiseman at Fri Aug 23 10:57:33 EDT 2019
STATUS

proposed

editing

#8 by Gus Wiseman at Fri Aug 23 10:44:47 EDT 2019
STATUS

editing

proposed

#7 by Gus Wiseman at Fri Aug 23 10:43:51 EDT 2019
CROSSREFS

These are Also positions of terms >=2 in A326787.

#6 by Gus Wiseman at Fri Aug 23 10:41:57 EDT 2019
EXAMPLE

The sequence of all set-systems with non-spanning 2-edge-connectivity >= 2 together with their BII-numbers begins:

#5 by Gus Wiseman at Fri Aug 23 10:41:00 EDT 2019
COMMENTS

A set-system has non-spanning 2-edge-connectivity >= 2 if if it is connected and any single edge can be removed (along with any non-covered vertices) without making the set-system disconnected or empty. Alternatively, these are connected set-systems whose bridges (edges whose removal disconnects the set-system or leaves isolated vertices) are all endpoints (edges intersecting only one other edge).

#4 by Gus Wiseman at Fri Aug 23 10:40:46 EDT 2019
COMMENTS

A set-system has non-spanning 2-edge-connectivity >= 2 if if it is connected and any single edge can be removed (along with any non-covered vertices) without making the set-system disconnected or empty. Alternatively, these are connected set-systems whose bridges (edges whose removal disconnects the set-system or leaves isolated vertices) are all endpoints (edges intersecting only one other edge).

#3 by Gus Wiseman at Fri Aug 23 10:39:24 EDT 2019
COMMENTS

A set-system has non-spanning 2-edge-connectivity >= 2 if any single edge can be removed (along with any non-covered vertices) without making the set-system disconnected or empty. Alternatively, these are connected set-systems whose bridges (edges whose removal disconnects the set-system or leaves isolated vertices) are all endpoints (edges intersecting only one other edge).

#2 by Gus Wiseman at Fri Aug 23 07:10:00 EDT 2019
NAME

allocated for Gus WisemanBII-numbers of set-systems with non-spanning edge-connectivity >= 2.

DATA

5, 6, 17, 20, 21, 24, 34, 36, 38, 40, 48, 52, 53, 54, 55, 56, 60, 61, 62, 63, 65, 66, 68, 69, 70, 71, 72, 80, 81, 84, 85, 86, 87, 88, 89, 92, 93, 94, 95, 96, 98, 100, 101, 102, 103, 104, 106, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121

OFFSET

1,1

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.

A set-system has non-spanning 2-edge-connectivity >= 2 if any single edge can be removed (along with any non-covered vertices) without making the set-system disconnected or empty. Alternatively, these are connected set-systems whose bridges (edges whose removal disconnects the set-system) are all endpoints (edges intersecting only one other edge).

EXAMPLE

The sequence of all set-systems with non-spanning 2-edge-connectivity >= 2 together with their BII-numbers begins:

5: {{1},{1,2}}

6: {{2},{1,2}}

17: {{1},{1,3}}

20: {{1,2},{1,3}}

21: {{1},{1,2},{1,3}}

24: {{3},{1,3}}

34: {{2},{2,3}}

36: {{1,2},{2,3}}

38: {{2},{1,2},{2,3}}

40: {{3},{2,3}}

48: {{1,3},{2,3}}

52: {{1,2},{1,3},{2,3}}

53: {{1},{1,2},{1,3},{2,3}}

54: {{2},{1,2},{1,3},{2,3}}

55: {{1},{2},{1,2},{1,3},{2,3}}

56: {{3},{1,3},{2,3}}

60: {{1,2},{3},{1,3},{2,3}}

61: {{1},{1,2},{3},{1,3},{2,3}}

62: {{2},{1,2},{3},{1,3},{2,3}}

63: {{1},{2},{1,2},{3},{1,3},{2,3}}

MATHEMATICA

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n, 2]], 1];

csm[s_]:=With[{c=Select[Tuples[Range[Length[s]], 2], And[OrderedQ[#], UnsameQ@@#, Length[Intersection@@s[[#]]]>0]&]}, If[c=={}, s, csm[Sort[Append[Delete[s, List/@c[[1]]], Union@@s[[c[[1]]]]]]]]];

edgeConn[y_]:=If[Length[csm[bpe/@y]]!=1, 0, Length[y]-Max@@Length/@Select[Union[Subsets[y]], Length[csm[bpe/@#]]!=1&]];

Select[Range[0, 100], edgeConn[bpe[#]]>=2&]

CROSSREFS

Graphs with spanning edge-connectivity >= 2 are counted by A095983.

Graphs with non-spanning edge-connectivity >= 2 are counted by A322395.

These are positions of terms >=2 in A326787.

BII-numbers for non-spanning edge-connectivity 2 are A327097.

BII-numbers for non-spanning edge-connectivity 1 are A327099.

BII-numbers for spanning edge-connectivity >= 2 are A327109.

Cf. A000120, A048793, A059166, A070939, A263296, A326031, A326749, A327076, A327101, A327102, A327108.

KEYWORD

allocated

nonn

AUTHOR

Gus Wiseman, Aug 23 2019

STATUS

approved

editing