Homomorphism complexes, reconfiguration, and homotopy for directed graphs
From MaRDI portal
Publication:2701005
DOI10.1016/J.EJC.2023.103704OpenAlexW3195448054MaRDI QIDQ2701005FDOQ2701005
Authors: Yanyan Li 
Publication date: 27 April 2023
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.10948
Recommendations
Cites Work
- Clique topology reveals intrinsic geometric structure in neural correlations
- Morse theory for cell complexes
- Tropical convexity
- Title not available (Why is that?)
- Triangulations. Structures for algorithms and applications
- Title not available (Why is that?)
- Sur le coloriage des graphs
- Vertex-to-vertex pursuit in a graph
- Algebraic topology and concurrency
- Title not available (Why is that?)
- 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
- Kneser's conjecture, chromatic number, and homotopy
- The Chromatic Number of Kneser Hypergraphs
- Hom complexes and homotopy theory in the category of graphs
- Mixing 3-colourings in bipartite graphs
- Tournament solutions and majority voting
- Flag arrangements and triangulations of products of simplices
- Complexes of graph homomorphisms
- Proof of the Lovász conjecture
- Connectedness of the graph of vertex-colourings
- Acyclic and oriented chromatic numbers of graphs
- Local chromatic number and distinguishing the strength of topological obstructions
- Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes
- Title not available (Why is that?)
- Local chromatic number, Ky Fan's theorem, and circular colorings
- Betti numbers of monomial ideals and shifted skew shapes
- Cellular resolutions of cointerval ideals
- Strong homotopy types, nerves and collapses
- Generalized Kneser coloring theorems with combinatorial proofs
- The universality of Hom complexes of graphs
- Topology of Hom complexes and test graphs for bounding chromatic number
- Topological lower bounds for the chromatic number: a hierarchy
- Title not available (Why is that?)
- Combinatorial algebraic topology
- Homology groups of relations
- Cellular resolutions of ideals defined by nondegenerate simplicial homomorphisms
- Hom complexes and hypergraph colorings
- Graph colorings, spaces of edges and spaces of circuits
- Small models of graph colouring manifolds and the Stiefel manifolds \(\Hom(C_{5},K_n)\)
- Gibbs measures and dismantlable graphs
- Title not available (Why is that?)
- A simple proof for folds on both sides in complexes of graph homomorphisms
- The geometry of products of minors
- The homotopy type of complexes of graph homomorphisms between cycles
- Box complexes, neighborhood complexes, and the chromatic number
- Homotopy theory for digraphs
- On generalized Kneser hypergraph colorings
- The neighborhood complex of a random graph
- Homotopy types of box complexes
- A short proof of a conjecture on the connectivity of graph coloring complexes
- Homomorphism complexes and \(k\)-cores
- Homotopy theory of graphs
- Homotopy groups of Hom complexes of graphs
- Quillen model structures on the category of graphs
- Homomorphism complexes and maximal chains in graded posets
- Homotopy types of the Hom complexes of graphs
- WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences
- Tournament solutions
- Six model categories for directed homotopy
- A homotopy category for graphs
- Box complexes and homotopy theory of graphs
- Title not available (Why is that?)
- (Lack of) model structures on the category of graphs
- Homomorphism reconfiguration via homotopy
- Morphism complexes of sets with relations
- Warmth and edge spaces of graphs
Cited In (10)
- Colourful theorems and indices of homomorphism complexes
- Diagram groups are totally orderable.
- Complexes of tournaments, directionality filtrations and persistent homology
- Homomorphism complexes, reconfiguration, and homotopy for directed graphs
- Homomorphism complexes, reconfiguration, and homotopy for directed graphs
- Homotopy, homology, and persistent homology using closure spaces
- Diagram groups and directed 2-complexes: homotopy and homology.
- Creating a network-state homomorphism through optimization
- Directed subgraph complexes
- Complexes of directed trees of complete multipartite graphs
Uses Software
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)
