2 papers
math.CO2024
Bounds for Rainbow-uncommon Graphs
Blake Bates, Zhanar Berikkyzy, Nick Chiem +6
We say a graph is -rainbow-uncommon if the maximum number of rainbow copies of under an -coloring of is asymptotically (as ) greater than what…
math.CO2022
A characterization of graphs with at most four boundary vertices
Nick Chiem, William Dudarov, Chris Lee +2
Steinerberger defined a notion of boundary for a graph and established a corresponding isoperimetric inquality. Hence, "large" graphs have more boundary vertices. In this paper, we…