Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups (Q4968732): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1601.02996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polyhedral product functor: A method of decomposition for moment-angle complexes, arrangements and related spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher topological complexity and its symmetrization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: TOPOLOGY OF RANDOM RIGHT ANGLED ARTIN GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological complexity of motion planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher topological complexity of subcomplexes of products of spheres and related polyhedral product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On colouring random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homology of certain algebras defined by graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On higher analogs of topological complexity / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962989881 / rank
 
Normal rank

Latest revision as of 10:25, 30 July 2024

scientific article; zbMATH DE number 7077646
Language Label Description Also known as
English
Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups
scientific article; zbMATH DE number 7077646

    Statements

    Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups (English)
    0 references
    0 references
    0 references
    0 references
    9 July 2019
    0 references
    random right angled Artin group
    0 references
    Erdős-Rényi model
    0 references
    pairwise disjoint maximal cliques
    0 references
    polyhedral products
    0 references
    sequential motion planning
    0 references

    Identifiers

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