Erdős-Ko-Rado theorems in certain semilattices (Q2441154): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Intersecting and cross-intersecting families of labeled sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting families of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of permutations with given maximal or minimal distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdös–Ko–Rado Theorem—22 Years Later / rank
 
Normal rank
Property / cites work
 
Property / cites work: Association schemes and t-designs in regular semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting families of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Ko-Rado theorem for vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by strongly closed subgraphs in \(d\)-bounded distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspaces in \(d\)-bounded distance-regular graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graphs induced by maximal totally isotropic flats of affine-unitary spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by orbits of subspaces under finite singular unitary group and its characteristic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by orbits of subspaces under finite singular orthogonal groups. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices Generated by Orbits of Subspaces Under Finite Singular Classical Groups and Its Characteristic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by orbits of subspaces under finite singular pseudo-symplectic groups. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by orbits of subspaces under finite singular pseudo-symplectic groups. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado theorems of labeled sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suborbits of \((m,k)\)-isotropic subspaces under finite singular classical groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by join of strongly closed subgraphs in \(d\)-bounded distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by subspaces in \(d\)-bounded distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of dual polar graph of orthogonal space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Character tables of the association schemes obtained from the finite affine classical groups acting on the sets of maximal totally isotropic flats / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices associated with totally isotropic subspaces in classical spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by orbits of flats under finite affine-symplectic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems for systems of finite vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by transitive sets of subspaces under finite classical groups I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by transitive sets of subspaces under finite classical groups II the orthogonal case of odd characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by transitive sets of subspaces under finite classical groups III the orthogonal case of even characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by transitive sets of subspaces under finite pseudo-symplectic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometricity of lattices generated by orbits of subspaces under finite classical groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Erdős--Ko--Rado theorem for partial permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado-type theorems for colored sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices Generated by Two Orbits of Subspaces Under Finite Singular Classical Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the Erdoes, Ko, Rado theorem to t-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strongly closed subgraphs of highly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorems of Erdős-Ko-Rado type in polar spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices Generated by Orbits of Flats Under Finite Affine Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singular linear space and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by orbits of totally isotropic flats under finite affine-classical groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Association schemes based on attenuated spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices associated with vector spaces over a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(D\)-bounded distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical distance-regular graphs of negative type / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact bound in the Erdős-Ko-Rado theorem / rank
 
Normal rank

Latest revision as of 11:42, 7 July 2024

scientific article
Language Label Description Also known as
English
Erdős-Ko-Rado theorems in certain semilattices
scientific article

    Statements

    Erdős-Ko-Rado theorems in certain semilattices (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2014
    0 references
    For a fixed natural number \(n\), let \([n]\) denote the set \(\{1, 2, \dots, n\}\). Let \(t\leq k\) be two natural numbers. A family \(\mathcal{A}\) of subsets of \([n]\) is \(t\)-intersecting if the cardinality of the intersection of every pair of sets in \(\mathcal{A}\) is at least \(t\), and is a \(k\)-family if every set in \(\mathcal{A}\) has cardinality \(k\). A classical result in extremal set theory is the theorem of \textit{P. Erdős} et al. [Q. J. Math., Oxf. II. Ser. 12, 313--320 (1961; Zbl 0100.01902)] which asserts that the largest possible \(t\)-intersecting \(k\)-family of subsets of \([n]\) are the families of all \(k\)-subsets containing some fixed \(t\)-subset of points whenever \(n\) is sufficiently large with respect to \(t\) and \(k\) (say, whenever \(n\geq n_0(t,k)\), where we use \(n_0(t,k)\) to denote the least integer for which the theorem is valid). In 1978, P. Frankl proved that \(n_0(t,k)= (t+1)(k-t+1)\) for \(t\geq 15\) and in general that \(n_0(t, k)\leq ct(k-t)\) where \(c\) is a constant not depending on \(t\), as had been conjectured by Erdős. \textit{R. M. Wilson} [Combinatorica 4, 247--257 (1984; Zbl 0556.05039)] proved that \(n_0(t,k)= (t+1)(k-t+1)\) in the remaining cases \(t=2,3, \dots, 14\) (with a proof valid for all \(t\)). In other words he proved the following result. Assume that \(t\leq k\) are two natural numbers. Let \(n\geq(t+1)(k-t+1)\) and \(\mathcal{A}\) be a \(t\)-intersecting \(k\)-family of subsets of \([n]\). Then \(|\mathcal{A}| \leq {n-t\choose k-t}\). If \(n > (t+1)(k-t+1)\) and \(|\mathcal{A}|={n-t\choose k-t}\), then \(\mathcal{A}\) consists of all \(k\)-subsets containing a fixed \(t\)-subset of \([n]\). \textit{S. Suda} [Discrete Math. 312, No. 10, 1827--1831 (2012; Zbl 1242.05033)] extended the Erdős-Ko-Rado theorem to designs in strongly regularized semilattices. In the paper under review, the authors generalize Suda's result in regularized semilattices and partition regularized semilattices, give many examples for theses semilattices and obtain their intersection theorems.
    0 references
    Erdős-Ko-Rado theorem
    0 references
    semilattice
    0 references
    regularized semilattice
    0 references
    strongly regularized semilattice
    0 references
    partition regularized semilattice
    0 references
    partition strongly regularized semilattice
    0 references
    0 references
    0 references

    Identifiers