The universality of Hom complexes of graphs (Q987561): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4871782 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexes of graph homomorphisms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proof of the Lovász conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4660718 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Homotopy types of box complexes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hom complexes and homotopy theory in the category of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Collapsing along monotone poset maps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5432047 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank | |||
Normal rank |
Latest revision as of 02:44, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The universality of Hom complexes of graphs |
scientific article |
Statements
The universality of Hom complexes of graphs (English)
0 references
13 August 2010
0 references
The Hom complex is a functional way to assign a poset (and hence a topological space) Hom\((T,G)\) to a pair of graphs \(T\) and \(G\). P. Csorba proved that any free \(\mathbb Z_2\)-space can be realized, up to \(\mathbb Z_2\)-homotopy type, as Hom\((K_2,G)\) for some suitably chosen graph \(G\) (here \(K_2\) is an edge) [see \textit{P. Csorba}, Combinatorica 27, No. 6, 669--682 (2007; Zbl 1236.05067)]. A natural question is to ask what homotopy types can be realized as Hom\((T,?)\) for other test graphs \(T\). The author proves that, given a connected graph \(T\) with at least one edge and an arbitrary finite simplicial complex \(X\), there is a graph \(G\) such that the complex Hom\((T,G)\) is homotopy equivalent to \(X\). Other results on Hom complexes, exponentials of graphs, and subdivisions complete the paper.
0 references
graph
0 references
homotopy equivalence
0 references
Hom complexes of graphs
0 references
clique complex
0 references
exponentials of graphs
0 references
subdivisions
0 references