1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.CO2021★ 1 cited
Inducibility of the Net Graph
Adam Blumenthal, Michael Phillips
A graph is called a fractalizer if for all the only graphs which maximize the number of induced copies of on vertices are the balanced iterated blow ups of . Whi…
math.CO2019
Independent Dominating Sets in Directed Graphs
Adam Blumenthal
In this paper, we study independent domination in directed graphs, which was recently introduced by Cary, Cary, and Prabhu. We provide a short, algorithmic proof that all directed…
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…