3 papers
math.CO2021
Paths of Length Three are -Turán Good
Kyle Murphy, JD Nir
The generalized Turán problem is to determine the maximal number of copies of a graph that can exist in an -free graph on vertices. Recently, Gerbner and Pa…
math.CO2020
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…
math.CO2020
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…