Well-mixing vertices and almost expanders

DOI10.1090/proc/16090zbMath1498.05247arXiv2108.12864OpenAlexW4312734416MaRDI QIDQ5039232

Hong Liu, Jinha Kim, Debsoumya Chakraborti, Jae-Hoon Kim, Min-Ki Kim

Publication date: 12 October 2022

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

random walks

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Random walks on graphs (05C81) Expander graphs (05C48)

Related Items (2)

Finding large expanders in graphs: from topological minors to induced subgraphs ⋮ Towards the Erdős-Gallai cycle decomposition conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On approximating the longest path in a graph
• The number of walks in a graph
• Proof of Komlós's conjecture on Hamiltonian subsets
• Compactness results in extremal graph theory
• Clique immersion in graphs without a fixed bipartite graph
• On Testing Expansion in Bounded-Degree Graphs
• A Sample of Samplers: A Computational Perspective on Sampling
• Finding long paths and cycles in sparse Hamiltonian graphs
• An Inequality Arising in Genetical Theory
• Expander graphs and their applications
• On clusterings
• A Separator Theorem for Planar Graphs
• Topological Cliques in Graphs
• Finding and Using Expanders in Locally Sparse Graphs
• Nested cycles with no geometric crossings
• Extremal density for sparse minors and subdivisions
• Complete Minors in Graphs Without Sparse Cuts
• Expanders – how to find them, and what to find in them
• A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
• An Expansion Tester for Bounded Degree Graphs

This page was built for publication: Well-mixing vertices and almost expanders