Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (Q1689038): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcta.2017.11.003 / rank
Normal rank
 
Property / author
 
Property / author: Andrey B. Kupavskii / rank
Normal rank
 
Property / author
 
Property / author: Andrey B. Kupavskii / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2291857129 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1510.03912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of low-dimensional spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every large set of equidistant (0,+1,-1)-vectors forms a sunflower / 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: Erdős-Ko-Rado theorem with conditions on the maximal degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of vectors without Antipodal pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to Borsuk’s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the Erdős-Chao Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5726070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular bipartite graphs and intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs / 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: Coloring Distance Graphs and Graphs of Diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Coding Theory* / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTA.2017.11.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:43, 11 December 2024

scientific article
Language Label Description Also known as
English
Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
scientific article

    Statements

    Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (English)
    0 references
    0 references
    0 references
    12 January 2018
    0 references
    Erdős-Ko-Rado theorem
    0 references
    antipodal vectors
    0 references
    \(\{0, \pm 1 \}\)-vectors
    0 references
    intersecting family
    0 references

    Identifiers