Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.09399 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917985666465792 |
|---|---|
| author | Ackerman, Nathanael Mirabi, Mostafa |
| author_facet | Ackerman, Nathanael Mirabi, Mostafa |
| contents | We define a generalization of threshold graphs which we call $k$-rainbow threshold graphs. We show that the collection of $k$-rainbow threshold graphs do not satisfy the $0$-$1$ law for first order logic and that asymptotically almost surely all $(k+1)$-rainbow threshold graphs are not isomorphic to a $k$-rainbow threshold graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_09399 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Rainbow Threshold Graphs Ackerman, Nathanael Mirabi, Mostafa Combinatorics 05C62, 03C13, 05C30 We define a generalization of threshold graphs which we call $k$-rainbow threshold graphs. We show that the collection of $k$-rainbow threshold graphs do not satisfy the $0$-$1$ law for first order logic and that asymptotically almost surely all $(k+1)$-rainbow threshold graphs are not isomorphic to a $k$-rainbow threshold graph. |
| title | Rainbow Threshold Graphs |
| topic | Combinatorics 05C62, 03C13, 05C30 |
| url | https://arxiv.org/abs/2504.09399 |