25 citations · 246 across the 55 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
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…
math.CO2018★ 23 cited
A bound on the inducibility of cycles
Daniel Kral, Sergey Norin, Jan Volec
In 1975, Pippenger and Golumbic conjectured that every n-vertex graph has at most induced cycles of length k for k at least 5. We prove that every n-vertex graph ha…