New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\) (Q6056562): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q5688995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on a theme of Graham and Pollak / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5663904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to the Alon-Saks-Seymour conjecture and related problems / 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: Polyboxes, cube tilings and rigidity / 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: How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged? / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:20, 3 August 2024

scientific article; zbMATH DE number 7745029
Language Label Description Also known as
English
New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\)
scientific article; zbMATH DE number 7745029

    Statements

    New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 October 2023
    0 references
    axis-aligned boxes
    0 references
    maximum size of sets with a given diameter in discrete hypercubes
    0 references

    Identifiers

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