5 citations · 20 across the 33 of their papers we have counts for
4 papers · 1 filter
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 vertices which does not contain the complete bipartite graph as a subgraph. A…
Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the Combinatorial Nullstellensatz
Oliver Janzer, Zoltán Lóránt Nagy
The long-standing Erdős-Faber-Lovász conjecture states that every -uniform linear hypergaph with edges has a proper vertex-coloring using colors. In this paper we propos…
On the Turán number of the blow-up of the hexagon
Oliver Janzer, Abhishek Methuku, Zoltán Lóránt Nagy
The -blowup of a graph , denoted by , is the graph obtained by replacing the vertices and edges of with independent sets of size and copies of , respec…
Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
Oliver Janzer
The rainbow Turán number of a graph is the maximum possible number of edges in a properly edge-coloured -vertex graph with no rainbow subgraph isomorphi…