The neighborhood complex of a random graph

DOI10.1016/j.jcta.2006.05.004zbMath1110.05090arXivmath/0512077OpenAlexW2081808419MaRDI QIDQ868889

Matthew Kahle

Publication date: 26 February 2007

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

coloringmorphism complexes

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items

Hierarchical sequencing of online social graphs, Phase transition in cohomology groups of non-uniform random simplicial complexes, Warmth and edge spaces of graphs, Random geometric complexes, Homomorphism complexes, reconfiguration, and homotopy for directed graphs, A social communication model based on simplicial complexes, Hajós-Type Constructions and Neighborhood Complexes, Persistent homology of complex networks, Homotopy types of box complexes of chordal graphs, Spectral gap bounds for the simplicial Laplacian and an application to random complexes, Homomorphism complexes and \(k\)-cores, The threshold function for vanishing of the top homology group of random 𝑑-complexes, Homomorphism complexes, reconfiguration, and homotopy for directed graphs, Homotopy groups of Hom complexes of graphs, The fundamental group of random 2-complexes, Dold's theorem from viewpoint of strong compatibility graphs, Topology of random clique complexes, Neighborhood hypergraph model for topological data analysis

Cites Work

• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Homological connectivity of random 2-complexes
• Hom complexes and homotopy theory in the category of graphs
• Topology of random clique complexes
• Box complexes, neighborhood complexes, and the chromatic number
• Complexes of graph homomorphisms
• Topological obstructions to graph colorings
• Paths in graphs