The Erdős-Ko-Rado theorem for twisted Grassmann graphs

DOI10.1007/s00493-012-2798-5zbMath1299.05313arXiv1012.5692OpenAlexW1987815082MaRDI QIDQ2448961

Hajime Tanaka

Publication date: 5 May 2014

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Ko-Rado theoremdistance regular graphstwisted Grassmann graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Extremal set theory (05D05)

Related Items (12)

Distance-regular graphs of large diameter that are completely regular clique graphs ⋮ Upper bounds for \(s\)-distance sets and equiangular lines ⋮ On \(q\)-analogues and stability theorems ⋮ Optimal and extremal graphical designs on regular graphs associated with classical parameters ⋮ A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices ⋮ Treewidth of the \(q\)-Kneser graphs ⋮ Theorems of Erdős-Ko-Rado type in geometrical settings ⋮ The Terwilliger algebra of the twisted Grassmann graph: the thin case ⋮ The Erdős-Ko-Rado theorem for singular linear spaces ⋮ The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings ⋮ A cross-intersection theorem for vector spaces based on semidefinite programming ⋮ Minimal Models and Abundance for Positive Characteristic Log Surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The twisted Grassmann graph is the block graph of a design
• Vertex subsets with minimal width and dual width in \(Q\)-polynomial distance-regular graphs
• The exact bound in the Erdős-Ko-Rado theorem
• Some properties of the twisted Grassmann graphs
• The spectra of the local graphs of the twisted Grassmann graphs
• The Erdős-Ko-Rado theorem for vector spaces
• An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
• An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
• Intersection theorems for systems of finite vector spaces
• Bilinear forms over a finite field, with applications to coding theory
• Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs
• Width and dual width of subsets in polynomial association schemes
• Theorems of Erdős-Ko-Rado type in polar spaces
• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
• A new family of distance-regular graphs with unbounded diameter
• Characterizing completely regular codes from an algebraic viewpoint
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Hypergeometric Orthogonal Polynomials and Their q-Analogues
• Some Erdös–Ko–Rado Theorems for Chevalley Groups
• The Weights in MDS Codes

This page was built for publication: The Erdős-Ko-Rado theorem for twisted Grassmann graphs