On the boxicity of Kneser graphs and complements of line graphs
From MaRDI portal
Publication:2689506
DOI10.1016/j.disc.2023.113333OpenAlexW3159129313MaRDI QIDQ2689506
Publication date: 10 March 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.02516
Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- Kneser's conjecture, chromatic number, and homotopy
- Boxicity of graphs with bounded degree
- Extremal problems concerning Kneser-graphs
- A characterization of Robert's inequality for boxicity
- The dimension of two levels of the Boolean lattice
- The order dimension of two levels of the Boolean lattices
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- Algorithmic graph theory and perfect graphs
- Boxicity of graphs on surfaces
- Boxicity and maximum degree
- Boxicity and treewidth
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Better bounds for poset dimension and boxicity
- Boxicity and Poset Dimension
This page was built for publication: On the boxicity of Kneser graphs and complements of line graphs
