Erdős–Ko–Rado Theorems: Algebraic Approaches
From MaRDI portal
Publication:3453101
DOI10.1017/CBO9781316414958zbMath1343.05002OpenAlexW2290756947MaRDI QIDQ3453101
Karen Meagher, Chris D. Godsil
Publication date: 20 November 2015
Full work available at URL: https://doi.org/10.1017/cbo9781316414958
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Association schemes, strongly regular graphs (05E30) Extremal set theory (05D05)
Related Items (97)
Gauss sums and the maximum cliques in generalized Paley graphs of square order ⋮ Erdős-Ko-Rado theorems for ovoidal circle geometries and polynomials over finite fields ⋮ An Erdős-Ko-Rado theorem for finite 2-transitive groups ⋮ Thin distance-regular graphs with classical parameters \((D, q, q, \frac{q^t-1}{q-1}-1)\) with \(t> D\) are the Grassmann graphs ⋮ Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ Algebras, graphs and thetas ⋮ Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations ⋮ The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities ⋮ Eigenvalues of the matching derangement graph ⋮ Intersection density of transitive groups of certain degrees ⋮ Boolean degree 1 functions on some classical association schemes ⋮ Eigenvalues of Cayley graphs ⋮ Some Erdös-Ko-Rado results for linear and affine groups of degree two ⋮ Upper bounds for \(s\)-distance sets and equiangular lines ⋮ Erdős-Ko-Rado sets of flags of finite sets ⋮ On the spectrum of the perfect matching derangement graph ⋮ An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings ⋮ Van Lint-MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields ⋮ Graphs whose Kronecker covers are bipartite Kneser graphs ⋮ An EKR-theorem for finite buildings of type \(D_{\ell }\) ⋮ On intersecting families of independent sets in trees ⋮ The spectral radii of intersecting uniform hypergraphs ⋮ An Erdős-Ko-Rado theorem for finite buildings of type \(F_4\) ⋮ A semidefinite programming approach to a cross-intersection problem with measures ⋮ An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings ⋮ An algebraic groups perspective on Erdős–Ko–Rado ⋮ The perfect matching association scheme ⋮ The unique coclique extension property for apartments of buildings ⋮ The core of a complementary prism ⋮ There is no going back: properties of the non-backtracking Laplacian ⋮ Graph homomorphisms via vector colorings ⋮ On t-Intersecting Hypergraphs with Minimum Positive Codegrees ⋮ Harmonic polynomials on perfect matchings ⋮ The core of a vertex-transitive complementary prism ⋮ On the 430-cap of \(\mathrm{PG}(6,4)\) having two intersection sizes with respect to hyperplanes ⋮ The \(q\)-analogue of zero forcing for certain families of graphs ⋮ Synchronising primitive groups of diagonal type exist ⋮ Hilton-Milner results in projective and affine spaces ⋮ Two conjectured strengthenings of Turán's theorem ⋮ On the flip graphs on perfect matchings of complete graphs and signed reversal graphs ⋮ Intersection theorems for finite general linear groups ⋮ An extension of the Erdős-Ko-Rado theorem to uniform set partitions ⋮ Integral graphs obtained by dual Seidel switching ⋮ Graphical designs and extremal combinatorics ⋮ Improved lower bounds on the extrema of eigenvalues of graphs ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ Separating rank 3 graphs ⋮ On the intersection density of the symmetric group acting on uniform subsets of small size ⋮ On eigenfunctions and maximal cliques of generalised Paley graphs of square order ⋮ Strongly cospectral vertices in normal Cayley graphs ⋮ New eigenvalue bound for the fractional chromatic number ⋮ On the intersection density of the Kneser graph \(K(n, 3)\) ⋮ Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs ⋮ High dimensional Hoffman bound and applications in extremal combinatorics ⋮ Nonassociativity of the Norton algebras of some distance regular graphs ⋮ Independence number of products of Kneser graphs ⋮ Weakly Hadamard diagonalizable graphs ⋮ Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring ⋮ The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings ⋮ An Erdős-Ko-Rado theorem for the group \(\mathrm{PSU}(3, q)\) ⋮ The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations ⋮ Spectral linear matrix inequalities ⋮ New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems ⋮ Stability for 1-intersecting families of perfect matchings ⋮ On the clique number of a strongly regular graph ⋮ Miklós-Manickam-Singhi conjectures on partial geometries ⋮ An inertial lower bound for the chromatic number of a graph ⋮ Cameron-Liebler sets of \(k\)-spaces in \(\mathrm{PG}(n,q)\) ⋮ The Erdős-Ko-Rado theorem for the derangement graph of the projective general linear group acting on the projective space ⋮ The second eigenvalue of some normal Cayley graphs of highly transitive groups ⋮ All 2-transitive groups have the EKR-module property ⋮ The \(p\)-restricted edge-connectivity of Kneser graphs ⋮ Endomorphisms of quadratic forms graph in characteristic two ⋮ Erdős-Ko-Rado theorems on the weak Bruhat lattice ⋮ 3-setwise intersecting families of the symmetric group ⋮ The toughness of Kneser graphs ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ Invitation to intersection problems for finite sets ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ Some observations on the smallest adjacency eigenvalue of a graph ⋮ On non-optimally expanding sets in Grassmann graphs ⋮ Circulant association schemes on triples ⋮ The EKR property for flag pure simplicial complexes without boundary ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ Erdős-Ko-Rado theorem for matrices over residue class rings ⋮ Unnamed Item ⋮ Using the existence of \(t\)-designs to prove Erdős-Ko-Rado ⋮ Regular intersecting families ⋮ On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs ⋮ Dual bounds for the positive definite functions approach to mutually unbiased bases ⋮ On complete multipartite derangement graphs ⋮ Alternating sign property of the perfect matching derangement graph ⋮ On the intersection density of primitive groups of degree a product of two odd primes ⋮ On state transfer in Cayley graphs for abelian groups ⋮ The EKR-module property of pseudo-Paley graphs of square order ⋮ On the eigenvalues of Grassmann graphs, bilinear forms graphs and Hermitian forms graphs ⋮ Homogeneous coherent configurations from spherical buildings and other edge-coloured graphs
This page was built for publication: Erdős–Ko–Rado Theorems: Algebraic Approaches
