Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
From MaRDI portal
Publication:2497975
Recommendations
- Width and dual width of subsets in polynomial association schemes
- Vertex subsets with minimal width and dual width in Q-polynomial distance-regular graphs
- An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
- The Erdős-Ko-Rado theorem for twisted Grassmann graphs
- On a characterization of bilinear forms graphs
Cites work
- A partially ordered set and q-Krawtchouk polynomials
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
- Association schemes and t-designs in regular semilattices
- Bilinear forms over a finite field, with applications to coding theory
- Erdös–Ko–Rado Theorem—22 Years Later
- Erdős-Ko-Rado-type results over J_q(n,d),H_q(n,d) and their designs
- Harmonics on posets
- scientific article; zbMATH DE number 4168725 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 47845 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for systems of finite vector spaces
- Some Erdös–Ko–Rado Theorems for Chevalley Groups
- The automorphism group and the convex subgraphs of the quadratic forms graph in characteristic 2
- The Erdős-Ko-Rado theorem for vector spaces
- The exact bound in the Erdős-Ko-Rado theorem
- The subconstituent algebra of a strongly regular graph
- Width and dual width of subsets in polynomial association schemes
Cited in
(57)- Commutative association schemes
- Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs
- Width and dual width of subsets in polynomial association schemes
- An EKR-theorem for finite buildings of type \(D_{\ell }\)
- Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs
- Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
- Generalized bilinear forms graphs and MRD codes over a residue class ring
- The Hilton-Milner theorem for attenuated spaces
- Cameron-Liebler sets in bilinear forms graphs
- Erdős-Ko-Rado theorem for matrices over residue class rings
- \(r\)-cross \(t\)-intersecting families for vector spaces
- Spectral properties of Cayley graphs over \(M_{m \times n}(F_q)\)
- Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
- Extremal t-intersecting families for direct products
- Matrix graphs and MRD codes over finite principal ideal rings
- Cameron-Liebler \(k\)-sets in \(\text{AG}(n,q)\)
- Remarks on polarity designs
- The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces
- The largest Erdős-Ko-Rado sets in \(2-(v,k,1)\) designs
- An Erdős-Ko-Rado theorem for finite buildings of type F₄
- An Erdős-Ko-Rado result for sets of pairwise non-opposite lines in finite classical polar spaces
- Theorems of Erdős-Ko-Rado type in polar spaces
- Theorems of Erdős-Ko-Rado type in geometrical settings
- Erdős-Ko-Rado theorems in certain semilattices
- The Erdős-Ko-Rado theorem for singular linear spaces
- The Erdős-Ko-Rado theorem for twisted Grassmann graphs
- An Erdős-Ko-Rado theorem for finite classical polar spaces
- Non-trivial t-intersecting families for symplectic polar spaces
- Non-existence of a ternary constant weight (16,5,15;2048) diameter perfect code
- The eigenvalue method for cross t-intersecting families
- On q-analogues and stability theorems
- The Hilton-Milner theorem for the distance-regular graphs of bilinear forms
- Nontrivial t-intersecting families for vector spaces
- A note on Huang-Zhao theorem on intersecting families with large minimum degree
- A cross-intersection theorem for vector spaces based on semidefinite programming
- Suboptimal s-union families and s-union antichains for vector spaces
- Intriguing sets of vertices of regular graphs
- The unique coclique extension property for apartments of buildings
- Optimal and extremal graphical designs on regular graphs associated with classical parameters
- A \(Q\)-polynomial structure for the attenuated space poset \(\mathcal{A}_q (N, M)\)
- Treewidth of the \(q\)-Kneser graphs
- PBIB-designs from certain subsets of distance-regular graphs
- Erdős-Ko-Rado theorem for vector spaces over residue class rings
- The maximum sum of sizes of non-empty cross t-intersecting families
- Non-trivial t-intersecting families for the distance-regular graphs of bilinear forms
- On cover-free families of finite vector spaces
- On r-cross t-intersecting families for vector spaces with large product of sizes
- s-almost t-intersecting families for vector spaces
- The nucleus of a Q-polynomial distance-regular graph
- Extremal problems for intersecting families of subspaces with a measure
- More on r-cross t-intersecting families for vector spaces
- An equitable partition for the distance-regular graph of the bilinear forms
- Simplices in t-intersecting families for vector spaces
- A bilinear form relating two Leonard systems
- A coloring problem for intersecting vector spaces
- Invitation to intersection problems for finite sets
- Tight distance-regular graphs with respect to subsets
This page was built for publication: Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497975)
