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.

User: Mason Nakamura

Mason Nakamura's wiki page.

Mason Nakamura has authored 1 sequences.

A346448 Number of nontrivial disconnected induced K_{1,3}-saturated graphs on n vertices.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 11, 88, 620
Offset: 0

Views

Author

Mason Nakamura, Evan Sabini, Xuwen Hua, Jared Glassband, Kathleen Ryan, Brian G. Kronenthal, Jul 30 2021

Keywords

Comments

A graph G is induced H-saturated if there exists no induced subgraph H in G, but for every edge e in the complement of G, the graph G+e has an induced subgraph H. We consider the complete graph K_n to be the trivial case. This is an empirical observation verified via a computer program.
Note that for n=11, the runtime is about 4 days.

Links

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

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