A Hilton-Milner theorem for vector spaces

MaRDI QIDQ976727zbMATHFDO

Authors Andries E. Brouwer, T. Mussche, Aart Blokhuis, Ameera Chowdhury, Peter Frankl, Balázs Patkós, Tamás Szőnyi

Publication date 16 June 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/230870

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

(q)-calculus and related topics (05A30) Extremal set theory (05D05)

Recommendations

• The chromatic number of the \(q\)-Kneser graph for large \(q\)
• The Hilton-Milner theorem for finite affine spaces
• The Hilton-Milner theorem for the distance-regular graphs of bilinear forms
• On the chromatic number of \(q\)-Kneser graphs
• Nontrivial \(t\)-intersecting families for vector spaces

Cited in

(41)

• The Hilton-Milner theorem for finite affine spaces
• scientific article; zbMATH DE number 490854 (Why is no real title available?)
• Non-trivial \(t\)-intersecting families for symplectic polar spaces
• Hilton-Milner results in projective and affine spaces
• Remarks on the Erdős matching conjecture for vector spaces
• Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space
• The chromatic number of the \(q\)-Kneser graph for large \(q\)
• The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces
• Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
• The Hilton-Milner theorem for attenuated spaces
• Correction to: ``Cameron-Liebler sets of \(k\)-spaces in \(\mathrm{PG}(n,q)\)
• Colouring lines in projective space
• Intersecting families of discrete structures are typically trivial
• A gap result for Cameron-Liebler \(k\)-classes
• Almost intersecting families for vector spaces
• A degree version of the Hilton-Milner theorem
• The largest Erdős-Ko-Rado sets in \(2-(v,k,1)\) designs
• The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces
• Theorems of Erdős-Ko-Rado type in geometrical settings
• A coloring problem for intersecting vector spaces
• Invitation to intersection problems for finite sets
• A \(t\)-intersecting Hilton-Milner theorem for vector spaces
• Suboptimal \(s\)-union families and \(s\)-union antichains for vector spaces
• On \(q\)-analogues and stability theorems
• The probability of spanning a classical space by two non-degenerate subspaces of complementary dimensions
• Maximal cocliques in the Kneser graph on point-plane flags in \(\mathrm{PG}(4,q)\)
• On the chromatic number of \(q\)-Kneser graphs
• The unique coclique extension property for apartments of buildings
• Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs
• Proof of a conjecture of Metsch
• Intersection theorems for vector spaces
• Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
• Cameron-Liebler sets of \(k\)-spaces in \(\mathrm{PG}(n,q)\)
• \(r\)-cross \(t\)-intersecting families for vector spaces
• Colourings without monochromatic disjoint pairs
• Nontrivial \(t\)-intersecting families for vector spaces
• On the chromatic number of two generalized Kneser graphs
• The Hilton-Milner theorem for the distance-regular graphs of bilinear forms
• A Kruskal-Katona-type theorem for graphs: \(q\)-Kneser graphs
• The maximum size of a partial spread in a finite projective space
• On the chromatic number of some generalized Kneser graphs

This page was built for publication: A Hilton-Milner theorem for vector spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976727)