Counting unlabeled interval graphs
H\"useyin Acan

TL;DR
This paper refines the asymptotic bounds on the number of unlabeled interval graphs with n vertices, showing that their logarithm grows approximately as n log n for large n.
Contribution
It provides improved bounds on the count of unlabeled interval graphs, establishing the asymptotic behavior of their logarithm as n log n.
Findings
log I_n ~ n log n as n approaches infinity
Established tighter bounds on the number of unlabeled interval graphs
Enhanced understanding of the combinatorial complexity of interval graphs
Abstract
We improve the bounds on the number of interval graphs on vertices. In particular, denoting by the quantity in question, we show that as .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
