14 citations · 31 across the 11 of their papers we have counts for
14 papers
Classification of borderenergetic chemical graphs and borderenergetic graphs of order 12
Péter Csikvári, Ivan Damnjanović, Marko Milošević +2
The energy of a simple graph is the sum of absolute values of the eigenvalues of its adjacency matrix. A borderenergetic graph of order is any noncomp…
Some applications of Wagner's weighted subgraph counting polynomial
Ferenc Bencs, Péter Csikvári, Guus Regts
We use Wagner's weighted subgraph counting polynomial to prove that the partition function of the anti-ferromagnetic Ising model on line graphs is real rooted and to prove that roo…
On Sidorenko's conjecture for determinants and Gaussian Markov random fields
Balazs Szegedy
We study a class of determinant inequalities that are closely related to Sidorenko's famous conjecture (Also conjectured by Erd\H os and Simonovits in a different form). Our result…
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…
Chromatic roots and limits of dense graphs
Peter Csikvari, Peter E. Frenkel, Jan Hladky +1
In this short note we observe that recent results of Abert and Hubai and of Csikvari and Frenkel about Benjamini--Schramm continuity of the holomorphic moments of the roots of the…
The Density Turán problem
Péter Csikvári, Zoltán Lóránt Nagy
Let be a graph on vertices and let the blow-up graph be defined as follows. We replace each vertex of by a cluster and connect some pairs of vertices…
Matchings in vertex-transitive bipartite graphs
Péter Csikvári
A theorem of A. Schrijver asserts that a -regular bipartite graph on vertices has at least perfect matchings. L. Gurvits gave…
Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
Péter Csikvári
Friedland's Lower Matching Conjecture asserts that if is a --regular bipartite graph on vertices, and denotes the number of matchings of size , then $$…
Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
Miklós Abért, Péter Csikvári, Tamás Hubai
We define the matching measure of a lattice L as the spectral measure of the tree of self-avoiding walks in L. We connect this invariant to the monomer-dimer partition function of…
Graph homomorphisms between trees
Péter Csikvári, Zhicong Lin
In this paper we study several problems concerning the number of homomorphisms of trees. We give an algorithm for the number of homomorphisms from a tree to any graph by the Transf…
Benjamini--Schramm continuity of root moments of graph polynomials
Péter Csikvári, Péter E. Frenkel
Recently, M.\ Abért and T.\ Hubai studied the following problem. The chromatic measure of a finite simple graph is defined to be the uniform distribution on its chromatic roots. Ab…