Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
1 answer
195 views

Explicit constructions of regular graphs with very sparse induced subgraphs

Let $d\ge 3$ be a constant. Is there an explicit construction of an infinite family of $d$-regular graphs such that for $G$ in this family with $n$ vertices, every subgraph $H$ of on at most $\alpha n$...
Sidhanth Mohanty's user avatar