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

38 papers

math.CO2026

Semi-Inducibility of some small graphs

József Balogh, Bernard Lidický, Dhruv Mubayi +2

Let $H$ be a fixed graph whose edges are colored red and blue and let $β \in [0, 1]$ . Let $I (H, β)$ be the (asymptotically normalized) maximum number of copies of $H$ in a large red/…

math.CO2025

On Relative Ordered Turán Density

Dylan King, Bernard Lidický, Minghui Ouyang +3

For an ordered graph $F$ , denote the Turán density by $π (F)$ . The relative Turán density, denoted by $ρ (F)$ , is the supremum over $α \in [0, 1]$ such that every ordered graph $G$ …

math.CO2024

The Hypergraph Turán Densities of Tight Cycles Minus an Edge

Bernard Lidicky, Connor Mattes, Florian Pfender

A tight $ℓ$ -cycle minus an edge $C_{ℓ}^{-}$ is the $3$ -graph on the vertex set $[ℓ]$ , where any three consecutive vertices in the string $123 \dots ℓ 1$ form an edge. We sho…

math.CO2024★ 2 cited

Small Ramsey numbers for books, wheels, and generalizations

Bernard Lidický, Gwen McKinley, Florian Pfender +1

In this work, we give several new upper and lower bounds on Ramsey numbers for books and wheels, including a tight upper bound establishing $R (W_{5}, W_{7}) = 15$ , matching upper and l…

math.CO2023

Triangle Percolation on the Grid

Igor Araujo, Bryce Frederickson, Robert A. Krueger +5

We consider a geometric percolation process partially motivated by recent work of Hejda and Kala. Specifically, we start with an initial set $X \subseteq Z^{2}$ , and then it…

math.CO2021★ 1 cited

Inducibility of 4-vertex tournaments

Dalton Burke, Bernard Lidický, Florian Pfender +1

We determine the inducibility of all tournaments with at most $4$ vertices together with the extremal constructions. The $4$ -vertex tournament containing an oriented $C_{3}$ and one…