Mixing is hard for triangle-free reflexive graphs

DOI10.1016/j.ejc.2023.103860arXiv2207.03632MaRDI QIDQ6146497

Hyobeen Kim, Jae-Baek Lee, Mark H. Siggers

Publication date: 5 February 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

simplicial complexHom-graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Unnamed Item
• Mixing 3-colourings in bipartite graphs
• Gibbs measures and dismantlable graphs
• Reconfiguring graph homomorphisms on the sphere
• Reconfiguration of homomorphisms to reflexive digraph cycles
• Introduction to reconfiguration
• Recolouring homomorphisms to triangle-free reflexive graphs
• Homomorphism reconfiguration via homotopy
• A Proof of the CSP Dichotomy Conjecture
• The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
• Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$

This page was built for publication: Mixing is hard for triangle-free reflexive graphs