5 citations · 20 across the 33 of their papers we have counts for
37 papers
On the asymptotics of the Erdős-Rogers function
Domagoj Bradač, Oliver Janzer, Rik Sarkar
The Erdős-Rogers function is the largest order of a -free induced subgraph guaranteed to exist in every -free graph on vertices. While this functio…
Tight bounds for positive discrepancy via eigenvalues
Oliver Janzer, István Tomon, Fredy Yip
Given an symmetric matrix with largest eigenvalue , it is easy to show that the solution of the optimisation problem is at mo…
On the generalized Turán number of complete bipartite graphs
Oliver Janzer, Sean Longbrake, Liana Yepremyan
For graphs and , the generalized Turán number denotes the maximum number of copies of in an -free graph on vertices. We prove that if $s\in \…
Independent sets and colorings of -free graphs
Abhishek Dhawan, Oliver Janzer, Abhishek Methuku
Alon, Krivelevich, and Sudakov conjectured in 1999 that every -free graph of maximum degree at most has chromatic number . This was previously known only for a…
Nearly tight bounds for MaxCut in hypergraphs
Oliver Janzer, Julien Portier
An -cut of a -uniform hypergraph is a partition of its vertex set into parts, and the size of the cut is the number of edges which have at least one vertex in each part.…
Short monochromatic odd cycles
Oliver Janzer, Fredy Yip
It is easy to see that every -edge-colouring of the complete graph on vertices contains a monochromatic odd cycle. In 1973, Erdős and Graham asked to estimate the smalle…