Invariant Hamming graphs in infinite quasi-median graphs (Q1126287): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Regular pseudo-median graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi‐median graphs and algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed cube theorem for median graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic location problem for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gated sets in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-edge theorem for graphs with loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects topologiques de la séparation dans les graphes infinis. I. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite invariant simplices in infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retract‐collapsible graphs and invariant subgraph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Helly property working as a compactness criterion on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prefibers and the cartesian product of metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compact median graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The retracts of Hamming graphs / rank
 
Normal rank

Latest revision as of 16:11, 24 May 2024

scientific article
Language Label Description Also known as
English
Invariant Hamming graphs in infinite quasi-median graphs
scientific article

    Statements

    Invariant Hamming graphs in infinite quasi-median graphs (English)
    0 references
    0 references
    0 references
    8 December 1996
    0 references
    A Hamming graph is a Cartesian product of complete graphs. The main results of the paper are: (i) a quasi-median graph without isometric rays contains a Hamming graph which is invariant under any automorphism; and (ii) any contraction of a rayless quasi-median graph stabilizes a finite Hamming graph.
    0 references
    0 references
    Hamming graph
    0 references
    quasi-median graph
    0 references
    isometric rays
    0 references
    0 references