Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) (Q729778): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1602.01215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the largest subsets avoiding the diameter of (0, ±1)-vectors / rank
 
Normal rank
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 cardinality of an s-distance subset in real Euclidean space. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal \(m\)-distance sets containing the representation of the Johnson graph \(J(n,m)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum sum and the maximum product of sizes of cross-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5521940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum planar sets that determine \(k\) distances / 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: An Intersection Theorem for a Collection of Families of Subsets of a Finite Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: New maximal two-distance sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of three-distance sets in two dimensional Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of maximum planar five-distance sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Erdős-Fishburn's conjecture for \(g(6)=13\) / 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 04:36, 13 July 2024

scientific article
Language Label Description Also known as
English
Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)
scientific article

    Statements

    Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 December 2016
    0 references
    Hamming graph
    0 references
    few-distance set
    0 references
    Euclidean representation
    0 references
    Erdős-Ko-Rado theorem
    0 references

    Identifiers