Oliver Janzer

activity

20182026

most citedThe extremal number of the subdivisions of the complete bipartite graph

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

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019★ 13 cited

The extremal number of the subdivisions of the complete bipartite graph

Oliver Janzer

For a graph $F$ , the $k$ -subdivision of $F$ , denoted $F^{k}$ , is the graph obtained by replacing the edges of $F$ with internally vertex-disjoint paths of length $k$ . In this paper,…

math.CO2019★ 4 cited

The extremal number of longer subdivisions

Oliver Janzer

For a multigraph $F$ , the $k$ -subdivision of $F$ is the graph obtained by replacing the edges of $F$ with pairwise internally vertex-disjoint paths of length $k + 1$ . Conlon and Lee…