Florian Pfender

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 2015Show all

2 papers · 1 filter

math.CO2015

Color-line and Proper Color-line Graphs

Van Bang Le, Florian Pfender

Motivated by investigations of rainbow matchings in edge colored graphs, we introduce the notion of color-line graphs that generalizes the classical concept of line graphs in a nat…

math.CO2015★ 4 cited

Increasing paths in edge-ordered graphs: the hypercube and random graphs

Jessica De Silva, Theodore Molla, Florian Pfender +2

An edge-ordering of a graph $G = (V, E)$ is a bijection $ϕ : E \to {1, 2, ..., ∣ E ∣}$ . Given an edge-ordering, a sequence of edges $P = e_{1}, e_{2}, ..., e_{k}$ is an increasing path if it is a path…