Independence numbers of Johnson-type graphs (Q6115445): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complete intersection theorem for systems of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring some finite sets in {R}^{n} / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hypergraph cliques with chromatic number 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of small-dimensional Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / 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: A Stability Result for Families with Fixed Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidding just one intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of vectors without Antipodal pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correction to the article: ``Intersection theorems for \((0,\pm1)\)-vectors and \(s\)-cross-intersecting families'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform eventown problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covers in uniform intersecting families and a counterexample to a conjecture of Lovász / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More-than-nearly-perfect packings and partial designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to Borsuk’s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial conjecture of Erdös / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference between asymptotically good packings and coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realization of distances within sets in Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borsuk's problem and the chromatic numbers of some metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Un problème de partition de l'ensemble des parties à trois éléments d'un ensemble fini / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic numbers of Kneser-type graphs / rank
 
Normal rank

Latest revision as of 16:58, 1 August 2024

scientific article; zbMATH DE number 7711676
Language Label Description Also known as
English
Independence numbers of Johnson-type graphs
scientific article; zbMATH DE number 7711676

    Statements

    Independence numbers of Johnson-type graphs (English)
    0 references
    0 references
    0 references
    12 July 2023
    0 references
    distance graphs
    0 references
    independence number
    0 references
    intersecting families
    0 references
    Erdös-Ko-Rado theorem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references