Skip to content

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 Sep 2026

Explicit Fractalizers: Prime-Order Paley Graphs and other Cayley Graphs

The inducibility problem asks for the maximum number of induced copies of a fixed graph among all graphs with a prescribed number of vertices. Inducibility has been an active area of research in extremal combinatorics, but determining all extremal graphs for explicitly defined patterns remains challenging, particularly...

Aldo Kiem, F. Wei · 0 citations

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