5 citations · 15 across the 15 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020★ 1 cited
The Erdős-Gyárfás function with respect to Gallai-colorings
Xihe Li, Hajo Broersma, Ligong Wang
For fixed and , an edge-coloring of the complete graph is said to be a -coloring if every receives at least distinct colors. The function $f(n, p, q)…
cs.LG2020
Dopant Network Processing Units: Towards Efficient Neural-network Emulators with High-capacity Nanoelectronic Nodes
Hans-Christian Ruiz-Euler, Unai Alegre-Ibarra, Bram van de Ven +3
The rapidly growing computational demands of deep neural networks require novel hardware designs. Recently, tunable nanoelectronic devices were developed based on hopping electrons…
math.CO2020
Extremal problems and results related to Gallai-colorings
Xihe Li, Hajo Broersma, Ligong Wang
A Gallai-coloring (Gallai--coloring) is an edge-coloring (with colors from ) of a complete graph without rainbow triangles. Given a graph and a positive…