Generalized Schreier sets, linear recurrence relation, Tur\'{a}n graphs
Combinatorics
2022-01-03 v1
Abstract
We prove a linear recurrence relation for a large family of generalized Schreier sets, which generalizes the Fibonacci recurrence proved by Bird and higher order Fibonacci recurrence proved by the second author et al. Furthermore, we show a relationship between Schreier-type sets and Tur\'{a}n graphs.
Cite
@article{arxiv.2112.14905,
title = {Generalized Schreier sets, linear recurrence relation, Tur\'{a}n graphs},
author = {Kevin Beanland and Hung Viet Chu and Carrie E. Finch-Smith},
journal= {arXiv preprint arXiv:2112.14905},
year = {2022}
}
Comments
5 pages. To appear in the Fibonacci Quarterly