24 citations · 69 across the 22 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018★ 2 cited
Triangle-free subgraphs with large fractional chromatic number
Bojan Mohar, Hehui Wu
It is well known that for any integers and , there is a graph with chromatic number at least and girth at least . In 1960's, Erdős and Hajnal conjectured that for any…
math.CO2018★ 2 cited
Fractional chromatic number of a random subgraph
Bojan Mohar, Hehui Wu
It is well known that a random subgraph of the complete graph has chromatic number w.h.p. Boris Bukh asked whether the same holds for a random subgraph of any $…