14 citations · 31 across the 11 of their papers we have counts for
4 papers · 1 filter
Graphs with Integer Matching Polynomial Roots
S. Akbari, P. Csikvari, A. Ghafari +2
In this paper, we study graphs whose matching polynomial have only integer zeros. A graph is matching integral if the zeros of its matching polynomial are all integers. We characte…
The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph
Emma Cohen, Péter Csikvári, Will Perkins +1
Let be the path on vertices with a loop at each vertex. D. Galvin conjectured, and E. Cohen, W. Perkins and P. Tetali proved that for any -regular simple g…
Sidorenko's conjecture, colorings and independent sets
Péter Csikvári, Zhicong Lin
Let denote the number of homomorphisms from a graph to a graph . Sidorenko's conjecture asserts that for any bipartite graph , and a graph we have $$\hom(…
Co-adjoint polynomial
Péter Csikvári
In this note we study a certain graph polynomial arising from a special recursion. This recursion is a member of a family of four recursions where the other three recursions belong…