1 citations · 2 across the 9 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
Wild number for spanning trees in complete and complete bipartite graphs
Aleyah Dawkins, Alexander Nappo, Jessie Tong +1
Given an edge-colored graph, the wild number measures how close the graph is to having a spanning tree in every color. We investigate this parameter for complete graphs and complet…
math.CO2026
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…