Expander spanning subgraphs with large girth

Itai Benjamini, Mikolaj Fraczyk, Gábor Kun

Research output: Contribution to journalArticlepeer-review

Abstract

We conjecture that in any finite graph with large Cheeger constant we can delete a proportion of edges in such a way that the remaining graph has large girth and retains good expansion properties. We prove this when the expansion is large enough in terms of the maximum degree. The condition on expansion covers, for example, large random d-regular graphs. Our proof relies on the Lovász Local Lemma.

Original languageEnglish
Pages (from-to)156-172
Number of pages17
JournalIsrael Journal of Mathematics
Volume251
DOIs
StatePublished - Dec 2022

All Science Journal Classification (ASJC) codes

  • General Mathematics

Fingerprint

Dive into the research topics of 'Expander spanning subgraphs with large girth'. Together they form a unique fingerprint.

Cite this