{"paper":{"title":"The spectrum and automorphism group of the set-inclusion graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianfeng Wang, Qiongxiang Huang, Xueyi Huang","submitted_at":"2018-09-04T11:02:39Z","abstract_excerpt":"Let $n$, $k$ and $l$ be integers with $1\\leq k<l\\leq n-1$. The set-inclusion graph $G(n,k,l)$ is the graph whose vertex set consists of all $k$- and $l$-subsets of $[n]=\\{1,2,\\ldots,n\\}$, where two distinct vertices are adjacent if one of them is contained in another. In this paper, we determine the spectrum and automorphism group of $G(n,k,l)$, respectively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00889","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}