Maximal \(m\)-distance sets containing the representation of the Johnson graph \(J(n,m)\) (Q713149): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.disc.2012.07.028 / rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1202.1352 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 9-Point and 7-Point Configurations in 3-Space / 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: New maximal two-distance sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4764151 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classification of three-distance sets in two dimensional Euclidean space / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DISC.2012.07.028 / rank | |||
Normal rank |
Latest revision as of 01:39, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximal \(m\)-distance sets containing the representation of the Johnson graph \(J(n,m)\) |
scientific article |
Statements
Maximal \(m\)-distance sets containing the representation of the Johnson graph \(J(n,m)\) (English)
0 references
26 October 2012
0 references
distance sets
0 references
Johnson graph
0 references