Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups

DOI10.1142/S1793525319500171zbMath1415.05164arXiv1601.02996OpenAlexW2962989881MaRDI QIDQ4968732

Jesús González, Hugo Mas, Bárbara Gutiérrez

Publication date: 9 July 2019

Published in: Journal of Topology and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.02996

zbMATH Keywords

polyhedral productsErdős-Rényi modelsequential motion planningpairwise disjoint maximal cliquesrandom right angled Artin group

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30) Braid groups; Artin groups (20F36) Combinatorial probability (60C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Simplicial sets and complexes in algebraic topology (55U10) Artificial intelligence for robotics (68T40) Polyhedral manifolds (52B70)

Related Items (1)

Topological complexity of graphic arrangements

Cites Work

• Higher topological complexity of subcomplexes of products of spheres and related polyhedral product spaces
• Higher topological complexity and its symmetrization
• Homology of certain algebras defined by graphs
• Topological complexity of motion planning
• Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups.
• On higher analogs of topological complexity
• The polyhedral product functor: A method of decomposition for moment-angle complexes, arrangements and related spaces
• TOPOLOGY OF RANDOM RIGHT ANGLED ARTIN GROUPS
• On colouring random graphs
• Paths in graphs

This page was built for publication: Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups