Homomorphism complexes, reconfiguration, and homotopy for directed graphs
From MaRDI portal
Publication:2701005
Recommendations
Cites work
- scientific article; zbMATH DE number 5704224 (Why is no real title available?)
- scientific article; zbMATH DE number 2151248 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- scientific article; zbMATH DE number 863503 (Why is no real title available?)
- scientific article; zbMATH DE number 7272506 (Why is no real title available?)
- scientific article; zbMATH DE number 2211584 (Why is no real title available?)
- (Lack of) model structures on the category of graphs
- A homotopy category for graphs
- A short proof of a conjecture on the connectivity of graph coloring complexes
- A simple proof for folds on both sides in complexes of graph homomorphisms
- Acyclic and oriented chromatic numbers of graphs
- Algebraic topology and concurrency
- Betti numbers of monomial ideals and shifted skew shapes
- Box complexes and homotopy theory of graphs
- Box complexes, neighborhood complexes, and the chromatic number
- Cellular resolutions of cointerval ideals
- Cellular resolutions of ideals defined by nondegenerate simplicial homomorphisms
- Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes
- Clique topology reveals intrinsic geometric structure in neural correlations
- Combinatorial algebraic topology
- Complexes of graph homomorphisms
- Connectedness of the graph of vertex-colourings
- Flag arrangements and triangulations of products of simplices
- Generalized Kneser coloring theorems with combinatorial proofs
- Gibbs measures and dismantlable graphs
- Graph colorings, spaces of edges and spaces of circuits
- Hom complexes and homotopy theory in the category of graphs
- Hom complexes and hypergraph colorings
- Homology groups of relations
- Homomorphism complexes and \(k\)-cores
- Homomorphism complexes and maximal chains in graded posets
- Homomorphism reconfiguration via homotopy
- Homotopy groups of Hom complexes of graphs
- Homotopy theory for digraphs
- Homotopy theory of graphs
- Homotopy types of box complexes
- Homotopy types of the Hom complexes of graphs
- Kneser's conjecture, chromatic number, and homotopy
- Local chromatic number and distinguishing the strength of topological obstructions
- Local chromatic number, Ky Fan's theorem, and circular colorings
- Mixing 3-colourings in bipartite graphs
- Morphism complexes of sets with relations
- Morse theory for cell complexes
- On generalized Kneser hypergraph colorings
- Proof of the Lovász conjecture
- Quillen model structures on the category of graphs
- Six model categories for directed homotopy
- Small models of graph colouring manifolds and the Stiefel manifolds \(\Hom(C_{5},K_n)\)
- Strong homotopy types, nerves and collapses
- Sur le coloriage des graphs
- The Chromatic Number of Kneser Hypergraphs
- The geometry of products of minors
- The homotopy type of complexes of graph homomorphisms between cycles
- The neighborhood complex of a random graph
- The universality of Hom complexes of graphs
- Topological lower bounds for the chromatic number: a hierarchy
- Topology of Hom complexes and test graphs for bounding chromatic number
- Tournament solutions
- Tournament solutions and majority voting
- Triangulations. Structures for algorithms and applications
- Tropical convexity
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- Vertex-to-vertex pursuit in a graph
- WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences
- Warmth and edge spaces of graphs
Cited in
(10)- Diagram groups are totally orderable.
- Colourful theorems and indices of homomorphism complexes
- Complexes of tournaments, directionality filtrations and persistent homology
- Homomorphism complexes, reconfiguration, and homotopy for directed graphs
- Diagram groups and directed 2-complexes: homotopy and homology.
- Homotopy, homology, and persistent homology using closure spaces
- Homomorphism complexes, reconfiguration, and homotopy for directed graphs
- Creating a network-state homomorphism through optimization
- Directed subgraph complexes
- Complexes of directed trees of complete multipartite graphs
This page was built for publication: Homomorphism complexes, reconfiguration, and homotopy for directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701005)
