98 citations · 348 across the 30 of their papers we have counts for
7 papers · 1 filter
Polychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles
Maria Axenovich, John Goldwasser, Ryan Hansen +5
If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polych…
Turán numbers of vertex-disjoint cliques in -partite graphs
Jessica De Silva, Kristin Heysse, Adam Kapilow +2
For two graphs and , the Turán number is the maximum number of edges in a subgraph of that contains no copy of . Chen, Li, and Tu determined the Turán numbe…
Note on von Neumann and Rényi entropies of a Graph
Michael Dairyko, Leslie Hogben, Jephian C. -H. Lin +4
We conjecture that all connected graphs of order have von Neumann entropy at least as great as the star and prove this for almost all graphs of order . We show t…
Anti-van der Waerden numbers of 3-term arithmetic progressions
Zhanar Berikkyzy, Alex Schulte, Michael Young
The \emph{anti-van der Waerden number}, denoted by , is the smallest such that every exact -coloring of contains a rainbow -term arithmetic progression.…
Multi-part Nordhaus-Gaddum type problems for tree-width, Colin de Verdière type parameters, and Hadwiger number
Leslie Hogben, Jephian C. -H. Lin, Michael Young
A traditional Nordhaus-Gaddum problem for a graph parameter is to find a (tight) upper or lower bound on the sum or product of and (where denotes…
Rainbow Arithmetic Progressions in Finite Abelian Groups
Michael Young
For positive integers and , the \emph{anti-van der Waerden number} of , denoted by , is the minimum number of colors needed to color the el…