Florian Pfender

activity

20242026

collaborators

3 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 $I^^{2} \in [0, 1]$ . Let $I (H, I^^{2})$ be the (asymptotically normalized) maximum number of copies of $H$ in a large re…

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 $I ¨ (F)$ . The relative TurÃ¡n density, denoted by $I ¨ (F)$ , is the supremum over $I^\pm \in [0, 1]$ such that every ordered grap…

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…