<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>
We present upper and lower bounds for the number i n i_n of interval graphs on n n vertices. Answering a question posed by Hanlon, we show that the ordinary generating function I ( x ) = ∑ n ≥ 0 i n x n I(x) = \sum _{n\ge 0} i_n\,x^n for the number i n i_n of n n -vertex interval graphs has radius of convergence zero. We also show that the exponential generating function J ( x ) = ∑ n ≥ 0 i n x n / n ! J(x) = \sum _{n\ge 0} i_n\,x^n/n! has radius of convergence at least 1 / 2 1/2 .
FOS: Mathematics, Mathematics - Combinatorics, 05C30, Combinatorics (math.CO)
FOS: Mathematics, Mathematics - Combinatorics, 05C30, Combinatorics (math.CO)
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |