activity
20052026
most citedMaximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle

53 citations · 217 across the 33 of their papers we have counts for

collaborators
Showing 2012Show all

3 papers · 1 filter

math.CO2012

Monochromatic triangles in three-coloured graphs

James Cummings, Daniel Král', Florian Pfender +3

In 1959, Goodman determined the minimum number of monochromatic triangles in a complete graph whose edge set is two-coloured. Goodman also raised the question of proving analogous…

math.CO2012

Combined degree and connectivity conditions for H-linked graphs

Florian Pfender

For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map τ: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every…

math.CO2012★ 7 cited

Large rainbow matchings in large graphs

Alexandr Kostochka, Florian Pfender, Matthew Yancey

A \textit{rainbow subgraph} of an edge-colored graph is a subgraph whose edges have distinct colors. The \textit{color degree} of a vertex is the number of different colors on…