Bernard Lidický

activity

20162026

most citedInducibility of directed paths

16 citations · 67 across the 17 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019★ 10 cited

Making $K_{r + 1}$ -Free Graphs $r$ -partite

József Balogh, Felix Christian Clemen, Mikhail Lavrov +2

The Erdős-Simonovits stability theorem states that for all ε>0 there exists α>0 such that if G is a K_{r+1}-free graph on n vertices with e(G) > ex(n,K_{r+1}) - αn^2, then one can…

math.CO2019★ 1 cited

Sharp bounds for decomposing graphs into edges and triangles

Adam Blumenthal, Bernard Lidický, Yanitsa Pehova +3

For a real constant $α$ , let $π_{3}^{α} (G)$ be the minimum of twice the number of $K_{2}$ 's plus $α$ times the number of $K_{3}$ 's over all edge decompositions of $G$ into copies of $K_{2}$ …

math.CO2019

Coloring count cones of planar graphs

Zdeněk Dvořák, Bernard Lidický

For a plane near-triangulation $G$ with the outer face bounded by a cycle $C$ , let $n_{G}^{⋆}$ denote the function that to each $4$ -coloring $ψ$ of $C$ assigns the number of ways $…

Making Kr+1​-Free Graphs r-partite

Sharp bounds for decomposing graphs into edges and triangles

Coloring count cones of planar graphs

Making $K_{r + 1}$ -Free Graphs $r$ -partite