Search
Search Results
-
-
Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
Ever since the famous Erdős-Ko-Rado theorem initiated the study of intersecting families of subsets, extremal problems regarding intersecting...
-
Introduction
The weak normal covering number and the normal covering number of the finite non-abelian simple groups. The normal 2-coverings and the weak normal...
-
Embedding Dimensions of Simplicial Complexes on Few Vertices
We provide a simple characterization of simplicial complexes on few vertices that embed into the d -sphere. Namely, a simplicial complex on
... -
A Turán Theorem for Extensions Via an Erdős-Ko-Rado Theorem for Lagrangians
The extension of an r -uniform hypergraph G is obtained from it by adding for every pair of vertices of G , which is not covered by an edge in G , an...
-
Ramsey Theory Before Ramsey: Schur’s Coloring Solution of a Colored Problem and Its Generalizations
Nobody remembered – if anyone even noticed – Hilbert’s 1892 lemma by the time the second Ramseyan type result appears in 1916 in number theory as...
-
A universal bound concerning t-intersecting families
A very short inductive proof is given for the maximal size of a k -graph on n vertices in which any two edges overlap in at least t vertices.
-
An Erdős–Ko–Rado theorem for finite buildings of type F4
In this paper we determine the largest sets of points of finite thick buildings of type F 4 such that no two points of the set are at maximal...
-
Critical Subgraphs of Schrijver Graphs for the Fractional Chromatic Number
Schrijver graphs are vertex-color-critical subgraphs of Kneser graphs having the same chromatic number. They also share the value of their fractional...
