8 citations · 33 across the 25 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
math.CO2024
Number of Eulerian orientations for Benjamini--Schramm convergent graph sequences
Ferenc Bencs, Márton Borbényi, Péter Csikvári
For a graph let denote the number of Eulerian orientations, and denote the number of vertices of . We show that if is a sequence of Euleria…
math.CO2024
Deterministic approximate counting of colorings with fewer than colors via absence of zeros
Ferenc Bencs, Khallil Berrekkal, Guus Regts
Let be integers. We prove that there exists such that if , then there exists an open set that contains the i…
math.CO2024★ 1 cited
Approximating the volume of a truncated relaxation of the independence polytope
Ferenc Bencs, Guus Regts
Answering a question of Gamarnik and Smedira, we give a polynomial time algorithm that approximately computes the volume of a truncation of a relaxation of the independent set poly…