A358358 -id:A358358 - cp's OEIS frontend

Showing 1-3 of 3 results.

A358356 Maximum length of an induced cycle (or chordless cycle) in the n-halved cube graph.

Original entry on oeis.org

0, 0, 3, 4, 5, 8, 12, 20

Offset: 1

Pontus von Brömssen, Nov 12 2022

Eric Weisstein's World of Mathematics, Halved Cube Graph.
Wikipedia, Halved cube graph.
Wikipedia, Induced path.

Cf. A000937, A357620, A358355, A358358.

a(n) <= A358355(n)+2.

A358357 Maximum length of an induced path (or chordless path) in the n-folded cube graph.

Original entry on oeis.org

1, 1, 2, 4, 10, 22

Offset: 2

Pontus von Brömssen, Nov 12 2022

Eric Weisstein's World of Mathematics, Folded Cube Graph.
Wikipedia, Folded cube graph.
Wikipedia, Induced path.

Cf. A099155, A357619, A358355, A358358.

a(n) >= A358358(n)-2. Equality holds for 3 <= n <= 7.

For n > 2, a(n) <= (2^(n-2)*n-1)/(n-1)-1. - Elijah Beregovsky, Dec 22 2022

A361187 Number of chordless cycles in the n-folded cube graph.

Original entry on oeis.org

0, 0, 36, 312, 20264, 136507408

Offset: 2

Eric W. Weisstein, Mar 03 2023

Using the convention that chordless cycles have length >= 4.

Without that convention, the only difference is that a(3) would be 4. - Pontus von Brömssen, Mar 10 2023

Eric Weisstein's World of Mathematics, Chordless Cycle
Eric Weisstein's World of Mathematics, Folded Cube Graph

Cf. A358358, A361149, A361186.

a(7) from Pontus von Brömssen, Apr 17 2023

Showing 1-3 of 3 results.