64 citations · 127 across the 14 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.CO2022★ 1 cited
New lower bounds on crossing numbers of from semidefinite programming
Daniel Brosch, Sven Polak
In this paper, we use semidefinite programming and representation theory to compute new lower bounds on the crossing number of the complete bipartite graph , extending a m…
math.CO2022★ 7 cited
The maximum cardinality of trifferent codes with lengths 5 and 6
Stefano Della Fiore, Alessandro Gnutti, Sven Polak
A code is said to be trifferent with length when for any three distinct elements of there exists a coordinate in which they…