Large maximal \ 0,1,2,,t\-cliques of the q-analog of the Johnson graph
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.
- scientific article; zbMATH DE number 4132192
- On the large maximal \(\{ 0,1,2,\dots,t\}\)-cliques in Hamming graph \(H(n,q)\)
- Maxima of the \(Q\)-index: graphs with bounded clique number
- Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs
- New bounds for the clique-chromatic numbers of Johnson graphs
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
- New bounds on clique-chromatic numbers of Johnson graphs
- On the maximal cliques of the quadratic forms graph in even characteristic
- A generalization of a Turán's theorem about maximum clique on graphs
- Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\)
This page was built for publication: Large maximal \(\{ 0,1,2,\dots,t\}\)-cliques of the \(q\)-analog of the Johnson graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563523)
