Bounds on Borsuk numbers in distance graphs of a special type (Q2044127): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3464534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Coding Theory* / 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: Q4037244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Illuminating sets of constant width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on clique-chromatic numbers of Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimate of the number of edges in special subgraphs of a distance graph / 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: Incompatible intersection properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree versions of theorems on intersecting families via stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: О рациональных аналогах проблем Нелсона - Хадвигера / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of some distance graphs / 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: On a bound in extremal combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Frankl-Wilson theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic numbers of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic numbers of Kneser-type graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples to Borsuk's conjecture with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Difference Between Consecutive Primes, II / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s0032946021020034 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3180304416 / rank
 
Normal rank

Latest revision as of 09:31, 30 July 2024

scientific article
Language Label Description Also known as
English
Bounds on Borsuk numbers in distance graphs of a special type
scientific article

    Statements

    Bounds on Borsuk numbers in distance graphs of a special type (English)
    0 references
    4 August 2021
    0 references
    Borsuk's problem
    0 references
    \((0, 1)\)-vectors
    0 references
    partitions
    0 references
    diameter graphs
    0 references
    colorings
    0 references
    0 references
    0 references
    0 references

    Identifiers

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