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 2017 · math.COShow all

3 papers · 2 filters

math.CO2017★ 17 cited

Pentagons in triangle-free graphs

Bernard Lidický, Florian Pfender

For all $n \geq 9$ , we show that the only triangle-free graphs on $n$ vertices maximizing the number $5$ -cycles are balanced blow-ups of a 5-cycle. This completely resolves a conject…

math.CO2017

On Edge-Colored Saturation Problems

Michael Ferrara, Daniel Johnston, Sarah Loeb +6

Let $C$ be a family of edge-colored graphs. A $t$ -edge colored graph $G$ is $(C, t)$ -saturated if $G$ does not contain any graph in $C$ but the additi…

math.CO2017★ 7 cited

Semidefinite Programming and Ramsey Numbers

Bernard Lidický, Florian Pfender

Finding exact Ramsey numbers is a problem typically restricted to relatively small graphs. The flag algebra method was developed to find asymptotic results for very large graphs, s…