Westminster College - Pennsylvania

output

20082026

most citedA giant planet undergoing extreme ultraviolet irradiation by its hot massive-star host

270 citations

Showing math.COShow all

3 papers · 1 filter

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★ 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.CO2016★ 5 cited

Polychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles

Maria Axenovich, John Goldwasser, Ryan Hansen +5

If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polych…