21 citations · 43 across the 10 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
Many cliques with few edges
Rachel Kirsch, A. J. Radcliffe
Recently Cutler and Radcliffe proved that the graph on vertices with maximum degree at most having the most cliques is a disjoint union of cliques…
math.CO2019★ 1 cited
Bounding the tripartite-circle crossing number of complete tripartite graphs
Charles Camacho, Silvia Fernández-Merchant, Marija Jelić Milutinović +4
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not…