Large maximal \(\{ 0,1,2,\dots,t\}\)-cliques of the \(q\)-analog of the Johnson graph (Q2563523)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 958144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Large maximal \(\{ 0,1,2,\dots,t\}\)-cliques of the \(q\)-analog of the Johnson graph |
scientific article; zbMATH DE number 958144 |
Statements
Large maximal \(\{ 0,1,2,\dots,t\}\)-cliques of the \(q\)-analog of the Johnson graph (English)
0 references
16 December 1996
0 references
Let \(V\) be an \(n\)-dimensional vector space over \(\text{GF}(q)\). A family \(F\) of subspaces of \(V\) is called \(k\)-uniform \(t\)-intersecting if \(\dim U=k\) and \(\dim(U\cap W)\geq t\) for all \(U,W\in F\). The author proves by combinatorial means that for \(1\leq t\leq k-2\) and for a fixed constant \(c>0\) there exists a number \(n^*=n^*(q,k,t,c)\) such that if \(n>n^*\), then the maximal (not extendable) \(k\)-uniform \(t\)-intersecting families \(F\) with size greater than \(c\cdot q^{(n-k)(k-t-1)}\) can be classified into four groups up to isomorphism.
0 references
Johnson graph
0 references
intersecting family
0 references
linear lattice
0 references
\(t\)-clique
0 references
Erdös-Ko-Rado theorem
0 references
vector space
0 references
0.9123293
0 references
0.8941816
0 references
0 references
0.87505376
0 references
0.87355185
0 references
0.87323594
0 references
0.86849964
0 references
0.8679424
0 references
0.86716026
0 references