5 citations · 20 across the 33 of their papers we have counts for
5 papers · 1 filter
Tiling with monochromatic bipartite graphs of bounded maximum degree
António Girão, Oliver Janzer
We prove that for any , there exists a constant such that the following is true. Let be an infinite sequence of bipartite gra…
Disproof of a conjecture of Erdős and Simonovits on the Turán number of graphs with minimum degree 3
Oliver Janzer
In 1981, Erdős and Simonovits conjectured that for any bipartite graph we have if and only if is -degenerate. Later, Erdős offered 250 doll…
Counting -free orientations of graphs
Matija Bucić, Oliver Janzer, Benny Sudakov
In 1974, Erdős posed the following problem. Given an oriented graph , determine or estimate the maximum possible number of -free orientations of an -vertex graph. When …
New results for MaxCut in -free graphs
Stefan Glock, Oliver Janzer, Benny Sudakov
The MaxCut problem asks for the size of a largest cut in a graph . It is well known that for any -edge graph , and the difference ${\rm…
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 contains a directed cycle of length at least . The best known lower…