53 citations · 217 across the 33 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
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 vertices together with the extremal constructions. The -vertex tournament containing an oriented and one…
math.CO2021★ 4 cited
is almost a fractalizer
Bernard Lidický, Connor Mattes, Florian Pfender
We determine the maximum number of induced copies of a 5-cycle in a graph on vertices for every . Every extremal construction is a balanced iterated blow-up of the 5-cycle w…