Projects per year

## Abstract

Recently, Huang gave a very elegant proof of the Sensitivity Conjecture by proving that hypercube graphs have the following property: every induced subgraph on a set of more than half the vertices has maximum degree at least √d, where d is the valency of the hypercube. This was generalised by Alon and Zheng who proved that every Cayley graph on an elementary abelian 2-group has the same property. Very recently, Potechin and Tsang proved an analogous results for Cayley graphs on abelian groups. They also conjectured that all Cayley graphs have the analogous property. We disprove this conjecture by constructing various counterexamples, including an infinite family of Cayley graphs of unbounded valency which admit an induced subgraph of maximum valency 1 on a set of more than half the vertices.

Original language | English |
---|---|

Pages (from-to) | 77-82 |

Number of pages | 6 |

Journal | Ars Mathematica Contemporanea |

Volume | 19 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1 Jan 2020 |

## Keywords

- Cayley graphs
- Sensitivity conjecture
- Vertex-transitive graphs

## ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Algebra and Number Theory

## Fields of Expertise

- Information, Communication & Computing

## Fingerprint

Dive into the research topics of 'Counterexamples to "A Conjecture on Induced Subgraphs of Cayley Graphs'''. Together they form a unique fingerprint.## Projects

- 1 Finished