Improved Bounds for the Extremal Number of Subdivisions. - Oliver Janzer (Electron. J. Comb., 2019)

Subsets of Cayley Graphs that Induce Many Edges. - Timothy Gowers; Oliver Janzer (Theory Comput., 2019)

The Extremal Number of the Subdivisions of the Complete Bipartite Graph. - Oliver Janzer (SIAM J. Discret. Math., 2020)

More on the Extremal Number of Subdivisions. - David Conlon; Joonkyung Lee; Oliver Janzer (Comb., 2021)

Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the Combinatorial Nullstellensatz. - Oliver Janzer; Zoltán Lóránt Nagy (Des. Codes Cryptogr., 2022)

The Turán number of blow-ups of trees. - Andrzej Grzesik; Oliver Janzer; Zoltán Lóránt Nagy (J. Comb. Theory B, 2022)

The maximum number of induced C 5 's in a planar graph. - Debarun Ghosh; Ervin Györi; Oliver Janzer; Addisu Paulos; Nika Salia; Oscar Zamora 001 (J. Graph Theory, 2022)

On the Turán Number of the Blow-Up of the Hexagon. - Oliver Janzer; Abhishek Methuku; Zoltán Lóránt Nagy (SIAM J. Discret. Math., 2022)

Asymptotics of the Hypergraph Bipartite Turán Problem. - Domagoj Bradac; Lior Gishboliner; Oliver Janzer; Benny Sudakov (Comb., 2023)

A kq/q-2 Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs. - Oliver Janzer; Peter Manohar (CoRR, 2024)

A $k^{ frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs. - Oliver Janzer; Peter Manohar (Electron. Colloquium Comput. Complex., 2024)

On locally rainbow colourings. - Barnabás Janzer; Oliver Janzer (J. Comb. Theory B, 2024)

On the Generalized Turán Problem for Odd Cycles. - Csongor Beke; Oliver Janzer (SIAM J. Discret. Math., 2024)

On the Zarankiewicz Problem for Graphs with Bounded VC-Dimension. - Oliver Janzer; Cosmin Pohoata (Comb., 2024)

Small Subgraphs with Large Average Degree. - Oliver Janzer; Benny Sudakov; István Tomon (Comb., 2024)

Induced Subgraphs of Kr-Free Graphs and the Erdős-Rogers Problem. - Lior Gishboliner; Oliver Janzer; Benny Sudakov (Comb., 2025)