{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:32:27Z","timestamp":1760524347558,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>\u00a0Let $n$, $k$ and $t$ be integers with $1\\leq t&lt; k \\leq n$. The generalized Kneser graph\u00a0$K(n,k,t)$ is a graph whose vertices are the $k$-subsets of a fixed $n$-set, where two $k$-subsets $A$ and $B$ are adjacent if $|A\\cap B|&lt;t$. The graph $K(n,k,1)$ is the well-known Kneser graph. In 2014, Harvey and Wood determined the exact treewidth of the Kneser graphs for large $n$ with respect to $k$. In this paper, we give the exact treewidth of the generalized Kneser graphs for $t\\geq2$ and large $n$ with respect to $k$ and $t$. In the special case when $t=k-1$, the graph $K(n,k,k-1)$ usually denoted by $\\overline{J(n,k)}$ which is the complement of the Johnson graph $J(n,k)$. We give a more precise result for the exact value of the treewidth of $\\overline{J(n,k)}$ for any $n$ and $k$.<\/jats:p>","DOI":"10.37236\/10035","type":"journal-article","created":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:51:19Z","timestamp":1649033479000},"source":"Crossref","is-referenced-by-count":3,"title":["Treewidth of the Generalized Kneser Graphs"],"prefix":"10.37236","volume":"29","author":[{"given":"Ke","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengyu","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mei","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2022,3,25]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i1p57\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i1p57\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:51:20Z","timestamp":1649033480000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v29i1p57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,25]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,1,27]]}},"URL":"https:\/\/doi.org\/10.37236\/10035","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2022,3,25]]},"article-number":"P1.57"}}