3 papers
math.CO2025
Maximizing subgraph density in graphs of bounded degree and clique number
Rachel Kirsch
We asymptotically determine the maximum density of subgraphs isomorphic to , where is any graph containing a dominating vertex, in graphs on vertices with bounded ma…
math.CO2025
Ore plus Turán
Aleyah Dawkins, Rachel Kirsch
Ore in 1961 determined the maximum number of edges in graphs not containing a Hamiltonian cycle, and Turán in 1941 found the maximum number of edges in graphs not containing a $K_…
math.CO2025
Maximizing the number of stars in graphs with forbidden properties
Zhanar Berikkyzy, Kirsten Hogenson, Rachel Kirsch +1
ErdÅs proved an upper bound on the number of edges in an -vertex non-Hamiltonian graph with given minimum degree and showed sharpness via two members of a particular graph fami…