Oliver Janzer

activity

20182021

most citedThe Turán number of blow-ups of trees

2 citations · 3 across the 3 of their papers we have counts for

collaborators

7 papers

math.CO2021

New results for MaxCut in $H$ -free graphs

Stefan Glock, Oliver Janzer, Benny Sudakov

The MaxCut problem asks for the size $mc (G)$ of a largest cut in a graph $G$ . It is well known that $mc (G) \geq m /2$ for any $m$ -edge graph $G$ , and the difference ${\rm…

math.CO2021★ 1 cited

Long directed paths in Eulerian digraphs

Oliver Janzer, Benny Sudakov, István Tomon

An old conjecture of Bollobás and Scott asserts that every Eulerian directed graph with average degree $d$ contains a directed cycle of length at least $Ω (d)$ . The best known lower…

math.CO2020

On the Zarankiewicz problem for graphs with bounded VC-dimension

Oliver Janzer, Cosmin Pohoata

The problem of Zarankiewicz asks for the maximum number of edges in a bipartite graph on $n$ vertices which does not contain the complete bipartite graph $K_{k, k}$ as a subgraph. A…

math.CO2020

Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles

Oliver Janzer

The rainbow Turán number $ex^{*} (n, H)$ of a graph $H$ is the maximum possible number of edges in a properly edge-coloured $n$ -vertex graph with no rainbow subgraph isomorphi…

math.CO2019★ 2 cited

The Turán number of blow-ups of trees

Andrzej Grzesik, Oliver Janzer, Zoltán Lóránt Nagy

A conjecture of Erdős from 1967 asserts that any graph on $n$ vertices which does not contain a fixed $r$ -degenerate bipartite graph $F$ has at most $C n^{2 - 1/ r}$ edges, where $C$ i…

math.CO2018

Subsets of Cayley graphs that induce many edges

W. T. Gowers, O. Janzer

Let $G$ be a regular graph of degree $d$ and let $A \subset V (G)$ . Say that $A$ is $η$ -closed if the average degree of the subgraph induced by $A$ is at least $η d$ . This says that i…