58 citations · 549 across the 45 of their papers we have counts for
46 papers
The Hypergraph Turán Densities of Tight Cycles Minus an Edge
Bernard Lidicky, Connor Mattes, Florian Pfender
A tight -cycle minus an edge is the -graph on the vertex set , where any three consecutive vertices in the string form an edge. We sho…
Hypergraph Turán Problems in -Norm
József Balogh, Felix Christian Clemen, Bernard Lidický
There are various different notions measuring extremality of hypergraphs. In this survey we compare the recently introduced notion of the codegree squared extremal function with th…
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 in some subset of has a…
Maximizing five-cycles in -free graphs
Bernard Lidický, Kyle Murphy
The Erdős Pentagon problem asks to find an -vertex triangle-free graph that is maximizing the number of -cycles. The problem was solved using flag algebras by Grzesik and ind…
Counterexamples to a conjecture of Harris on Hall ratio
Adam Blumenthal, Bernard Lidicky, Ryan R. Martin +3
The Hall ratio of a graph is the maximum value of taken over all non-null subgraphs of . For any graph, the Hall ratio is a lower-bound on its fractional c…
Partition problems in high dimensional boxes
Matija Bucic, Bernard Lidicky, Jason Long +1
Alon, Bohman, Holzman and Kleitman proved that any partition of a -dimensional discrete box into proper sub-boxes must consist of at least sub-boxes. Recently, Leader, Mil…