4 papers
Maximizing the number of cliques in -free graphs with forbidden properties
Aleyah Dawkins, Rachel Kirsch
Ferrero and Lesniak in 2018 found the maximum numbers of edges in -partite non-Hamiltonian graphs. Recently we found the maximum numbers of edges and -cliques in -fr…
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 famil…
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…
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_{…