Ferenc Bencs

According to our database1, Ferenc Bencs authored at least 18 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Approximating the chromatic polynomial is as hard as computing it exactly.
Comput. Complex., June, 2024

Factor-of-iid balanced orientation of non-amenable graphs.
Eur. J. Comb., January, 2024

Factor-of-iid Schreier decorations of lattices in Euclidean spaces.
Discret. Math., 2024

Deterministic approximate counting of colorings with fewer than 2Δ colors via absence of zeros.
CoRR, 2024

Approximating the volume of a truncated relaxation of the independence polytope.
CoRR, 2024

2023
Upper bound for the number of spanning forests of regular graphs.
Eur. J. Comb., May, 2023

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees.
CoRR, 2023

On the Location of Chromatic Zeros of Series-Parallel Graphs.
Electron. J. Comb., 2023

On complex roots of the independence polynomial.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Evaluations of Tutte polynomials of regular graphs.
J. Comb. Theory B, 2022

Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite Δ-regular tree for large Δ.
CoRR, 2022

2021
Some coefficient sequences related to the descent polynomial.
Eur. J. Comb., 2021

Some Applications of Wagner's Weighted Subgraph Counting Polynomial.
Electron. J. Comb., 2021

2018
On trees with real-rooted independence polynomial.
Discret. Math., 2018

Christoffel-Darboux Type Identities for the Independence Polynomial.
Comb. Probab. Comput., 2018

On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs.
CoRR, 2018

2017
One more remark on the adjoint polynomial.
Eur. J. Comb., 2017

2016
Compositions of Complements of Graphs.
Integers, 2016


  Loading...