Treewidth of the generalized Kneser graphs

DOI10.37236/10035zbMath1486.05260arXiv2011.12725OpenAlexW3109037159MaRDI QIDQ2121803

Mengyu Cao, Mei Lu, Ke Liu

Publication date: 4 April 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.12725

zbMATH Keywords

independence numbertreewidth of a graph

Mathematics Subject Classification ID

Extremal set theory (05D05) Structural characterization of families of graphs (05C75)

Related Items (2)

Treewidth of the \(q\)-Kneser graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
• The treewidth of line graphs
• Kneser's conjecture, chromatic number, and homotopy
• The exact bound in the Erdős-Ko-Rado theorem
• Graph minors. III. Planar tree-width
• Graph minors. I. Excluding a forest
• S-functions for graphs
• The odd girth of the generalised Kneser graph
• Automorphisms and regular embeddings of merged Johnson graphs
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
• A characterization of Grassmann and Johnson graphs
• On the chromatic number, colorings, and codes of the Johnson graph
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Graph minors. II. Algorithmic aspects of tree-width
• Complexity of Finding Embeddings in a k-Tree
• On the treewidth of random geometric graphs and percolated grids
• On Treewidth and Related Parameters of Random Geometric Graphs
• Treewidth of Cartesian Products of Highly Connected Graphs
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• The Johnson graphs satisfy a distance extension property

This page was built for publication: Treewidth of the generalized Kneser graphs