Using Graph Theory to Derive Inequalities for the Bell Numbers

04/01/2021
by   Alain Hertz, et al.
0

The Bell numbers count the number of different ways to partition a set of n elements while the graphical Bell numbers count the number of non-equivalent partitions of the vertex set of a graph into stable sets. This relation between graph theory and integer sequences has motivated us to study properties on the average number of colors in the non-equivalent colorings of a graph to discover new non trivial inequalities for the Bell numbers. Example are given to illustrate our approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2021

Upper bounds on the average number of colors in the non-equivalent colorings of a graph

A coloring of a graph is an assignment of colors to its vertices such th...
research
03/19/2021

Frobenius Numbers and Automatic Sequences

The Frobenius number g(S) of a set S of non-negative integers with 1 is ...
research
04/29/2021

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph

We study the average number 𝒜(G) of colors in the non-equivalent colorin...
research
06/25/2022

On the computational properties of the uncountability of the real numbers

The uncountability of the real numbers is one of their most basic proper...
research
02/25/2023

Construction numbers: How to build a graph?

We count the number of ways to build paths, stars, cycles, and complete ...
research
11/02/2015

On the Number of Many-to-Many Alignments of Multiple Sequences

We count the number of alignments of N > 1 sequences when match-up types...
research
04/01/2019

An Alternative Set Model of Cognitive Jump

When we enumerate numbers up to some specific value, or, even if we do n...

Please sign up or login with your details

Forgot password? Click here to reset