13 citations · 17 across the 3 of their papers we have counts for
6 papers
Hamiltonicity of regular sublinear expanders
Domagoj Bradač, Oliver Janzer
We say that a -regular graph is a -expander if for every not too large set of vertices , there are at least edges leaving , and we say that a graph is -…
An improved upper bound for the multicolour Ramsey number of odd cycles
Maria Axenovich, Wouter Cames van Batenburg, Oliver Janzer +2
We show that the -colour Ramsey number of an odd cycle of length is at most . This proves a conjecture of Fox and is the first improvem…
The maximum number of induced 's in a planar graph
Debarun Ghosh, Ervin Győri, Oliver Janzer +3
Finding the maximum number of induced cycles of length in a graph on vertices has been one of the most intriguing open problems of Extremal Graph Theory. Recently Balogh, H…
The extremal number of the subdivisions of the complete bipartite graph
Oliver Janzer
For a graph , the -subdivision of , denoted , is the graph obtained by replacing the edges of with internally vertex-disjoint paths of length . In this paper,…
The extremal number of longer subdivisions
Oliver Janzer
For a multigraph , the -subdivision of is the graph obtained by replacing the edges of with pairwise internally vertex-disjoint paths of length . Conlon and Lee…
Improved bounds for the extremal number of subdivisions
Oliver Janzer
Let be the subdivision of . Very recently, Conlon and Lee have proved that for any integer , there exists a constant such that $\text{ex}(n,H_t)\leq Cn^{3/2…