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.

Showing 1-1 of 1 results.

A350292 Triangle read by rows: the n-th row gives the saturated vertex Turán numbers for the cube graph Q_n.

Original entry on oeis.org

1, 2, 1, 6, 3, 1, 12, 8, 4, 1, 24, 20, 10, 5, 1
Offset: 1

Views

Author

Stefano Spezia, Dec 23 2021

Keywords

Comments

The k-th saturated vertex Turán number for the cube graph Q_n is the maximum number of vertices to be deleted from the cube graph such that no subgraph Q_k is complete and each of the deleted vertices being added again completes a subgraph Q_k (see Harborth and Nienborg).

Examples

			n\k |   1    2    3    4    5
----+------------------------
  1 |   1
  2 |   2    1
  3 |   6    3    1
  4 |  12    8    4    1
  5 |  24   20   10    5    1
  ...

Links

Crossrefs

Cf. A350293 (k = 1), A350295 (2nd subdiagonal).

Formula

T(n, n) = 1 and T(n, n-1) = n (see Theorem 2 in Harborth and Nienborg).
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.