22 citations · 107 across the 16 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DS2018★ 1 cited
Tight complexity lower bounds for integer linear programming with few constraints
Dušan Knop, Michał Pilipczuk, Marcin Wrochna
We consider the ILP Feasibility problem: given an integer linear program , where is an integer matrix with rows and columns and is a vector…
math.CO2018
Hedetniemi's conjecture and strongly multiplicative graphs
Claude Tardif, Marcin Wrochna
A graph K is multiplicative if a homomorphism from any product G x H to K implies a homomorphism from G or from H. Hedetniemi's conjecture states that all cliques are multiplicativ…
math.CO2018
The step Sidorenko property and non-norming edge-transitive graphs
Daniel Král', Taísa Martins, Péter Pál Pach +1
Sidorenko's Conjecture asserts that every bipartite graph H has the Sidorenko property, i.e., a quasirandom graph minimizes the density of H among all graphs with the same edge den…