More Cases Where the Kruskal-Katona Bound is Tight
Combinatorics
2018-12-27 v2
Abstract
In graph theory, knowing the number of complete subgraphs with r vertices that a graph g has, limits the number of its complete subgraphs with s vertices, for s > r. A useful upper bound is provided by the Kruskal-Katona theorem, but this bound is often not tight. In this note, we add to the known cases where this bound is tight and begin an investigation of tight bounded graph sequences.
Cite
@article{arxiv.1809.03967,
title = {More Cases Where the Kruskal-Katona Bound is Tight},
author = {Robert Cowen},
journal= {arXiv preprint arXiv:1809.03967},
year = {2018}
}
Comments
This is now part of my paper, arXiv:1810.05704 "The Kruskal-Katona Theorem for Graphs."