Skip to content

Author

Barnabás Janzer

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Small subgraphs of large minimum degree

In 1991, Erd\H{o}s, Faudree, Rousseau and Schelp asked to estimate the smallest $u=u(n,d,s)$ such that every $n$-vertex graph with average degree at least $d$ has a subgraph on at most $u$ vertices with minimum degree at least $s$. We resolve this problem up to polylogarithmic factors for all even values of $s$. More p...

Zach Hunter, Barnabás Janzer, Oliver Janzer et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.