Adam Blumenthal

activity

20182021

most citedInducibility of the Net Graph

1 citations · 2 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2021★ 1 cited

Inducibility of the Net Graph

Adam Blumenthal, Michael Phillips

A graph $F$ is called a fractalizer if for all $n$ the only graphs which maximize the number of induced copies of $F$ on $n$ vertices are the balanced iterated blow ups of $F$ . 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.CO2019★ 1 cited

Sharp bounds for decomposing graphs into edges and triangles

Adam Blumenthal, Bernard Lidický, Yanitsa Pehova +3

For a real constant $α$ , let $π_{3}^{α} (G)$ be the minimum of twice the number of $K_{2}$ 's plus $α$ times the number of $K_{3}$ 's over all edge decompositions of $G$ into copies of $K_{2}$ …

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 $G$ is the maximum value of $v (H) / α (H)$ taken over all non-null subgraphs $H$ of $G$ . For any graph, the Hall ratio is a lower-bound on its fractional c…