Bernard Lidický

activity

20092024

most citedUpper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube

58 citations · 549 across the 45 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

math.CO2020★ 1 cited

On Weak Flexibility in Planar Graphs

Bernard Lidický, Tomáš Masařík, Kyle Murphy +1

Recently, Dvořák, Norin, and Postle introduced flexibility as an extension of list coloring on graphs [JGT 19']. In this new setting, each vertex $v$ in some subset of $V (G)$ has a…

math.CO2020★ 9 cited

Maximizing five-cycles in $K_{r}$ -free graphs

Bernard Lidický, Kyle Murphy

The Erdős Pentagon problem asks to find an $n$ -vertex triangle-free graph that is maximizing the number of $5$ -cycles. The problem was solved using flag algebras by Grzesik and ind…

On Weak Flexibility in Planar Graphs

Maximizing five-cycles in Kr​-free graphs

Maximizing five-cycles in $K_{r}$ -free graphs