# Large Minors in Expanders

@article{Chuzhoy2019LargeMI, title={Large Minors in Expanders}, author={Julia Chuzhoy and Rachit Nimavat}, journal={ArXiv}, year={2019}, volume={abs/1901.09349} }

In this paper we study expander graphs and their minors. Specifically, we attempt to answer the following question: what is the largest function $f(n,\alpha,d)$, such that every $n$-vertex $\alpha$-expander with maximum vertex degree at most $d$ contains {\bf every} graph $H$ with at most $f(n,\alpha,d)$ edges and vertices as a minor? Our main result is that there is some universal constant $c$, such that $f(n,\alpha,d)\geq \frac{n}{c\log n}\cdot \left(\frac{\alpha}{d}\right )^c$. This boundâ€¦Â Expand

#### Figures and Topics from this paper

#### 3 Citations

Quantum Advantage with Shallow Circuits under Arbitrary Corruption

- Computer Science, Physics
- ArXiv
- 2021

#### References

SHOWING 1-10 OF 36 REFERENCES

A Separator Theorem in Minor-Closed Classes

- Mathematics, Computer Science
- 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
- 2010

Existence and Construction of Edge-Disjoint Paths on Expander Graphs

- Mathematics, Computer Science
- SIAM J. Comput.
- 1994

Edge Disjoint Paths in Moderately Connected Graphs

- Mathematics, Computer Science
- SIAM J. Comput.
- 2010

Finding and Using Expanders in Locally Sparse Graphs

- Mathematics, Computer Science
- SIAM J. Discret. Math.
- 2018

Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions

- Mathematics, Computer Science
- 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
- 2010