On a conjecture of V. Nikiforov. - Péter Csikvári (Discret. Math., 2009)

Micro-hotplates for thermal characterisation of structural materials of MEMS. - Péter Csikvári; Péter Fürjes; Csaba Dücso; István Bársony (Microelectron. J., 2009)

On a poset of trees. - Péter Csikvári (Comb., 2010)

Applications of the Kelmans Transformation: Extremality of the Threshold Graphs. - Péter Csikvári (Electron. J. Comb., 2011)

On the roots of edge cover polynomials of graphs. - Péter Csikvári; Mohammad Reza Oboudi (Eur. J. Comb., 2011)

Density and ramsey type results on algebraic equations with restricted solution sets. - Péter Csikvári; Katalin Gyarmati; András Sárközy (Comb., 2012)

The Density Turán Problem. - Péter Csikvári; Zoltán Lóránt Nagy (Comb. Probab. Comput., 2012)

Two remarks on the adjoint polynomial. - Péter Csikvári (Eur. J. Comb., 2012)

Note on the Smallest Root of the Independence Polynomial. - Péter Csikvári (Comb. Probab. Comput., 2013)

On a Poset of Trees II. - Péter Csikvári (J. Graph Theory, 2013)

Graph Homomorphisms between Trees. - Péter Csikvári; Zhicong Lin (Electron. J. Comb., 2014)

Homomorphisms of Trees into a Path. - Péter Csikvári; Zhicong Lin (SIAM J. Discret. Math., 2015)

Graphs with Integer Matching Polynomial Roots. - Saieed Akbari; Péter Csikvári; A. Ghafari; S. Khalashi Ghezelahmad; Mina Nahvi (CoRR, 2016)

Benjamini-Schramm continuity of root moments of graph polynomials. - Péter Csikvári; Péter E. Frenkel (Eur. J. Comb., 2016)

Sidorenko's Conjecture, Colorings and Independent Sets. - Péter Csikvári; Zhicong Lin (Electron. J. Comb., 2017)

Graphs with integer matching polynomial zeros. - Saieed Akbari; Péter Csikvári; A. Ghafari; S. Khalashi Ghezelahmad; Mina Nahvi (Discret. Appl. Math., 2017)

Chromatic roots and limits of dense graphs. - Péter Csikvári; Péter E. Frenkel; Jan Hladký; Tamás Hubai (Discret. Math., 2017)

The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph. - Emma Cohen; Péter Csikvári; Will Perkins 001; Prasad Tetali (Eur. J. Comb., 2017)

Counting Homomorphisms in Bipartite Graphs. - Shahab Shams; Nicholas Ruozzi; Péter Csikvári (ISIT, 2019)

Covers, Orientations and Factors. - Péter Csikvári; András Imolay (Electron. J. Comb., 2020)

Counting degree-constrained subgraphs and orientations. - Márton Borbényi; Péter Csikvári (Discret. Math., 2020)

Some Applications of Wagner's Weighted Subgraph Counting Polynomial. - Ferenc Bencs; Péter Csikvári; Guus Regts (Electron. J. Comb., 2021)

On the Number of Forests and Connected Spanning Subgraphs. - Márton Borbényi; Péter Csikvári; Haoran Luo (Graphs Comb., 2021)

Evaluations of Tutte polynomials of regular graphs. - Ferenc Bencs; Péter Csikvári (J. Comb. Theory B, 2022)

Markov Random Fields, Homomorphism Counting, and Sidorenko's Conjecture. - Péter Csikvári; Nicholas Ruozzi; Shahab Shams (IEEE Trans. Inf. Theory, 2022)

On complex roots of the independence polynomial. - Ferenc Bencs; Péter Csikvári; Piyush Srivastava 001; Jan Vondrák (SODA, 2023)

On Sidorenko's conjecture for determinants and Gaussian Markov random fields. - Péter Csikvári; Balázs Szegedy (Random Struct. Algorithms, 2023)

Short proof of a theorem of Brylawski on the coefficients of the Tutte polynomial. - Csongor Beke; Gergely Kál Csáji; Péter Csikvári; Sára Pituk (Eur. J. Comb., 2023)

Upper bound for the number of spanning forests of regular graphs. - Ferenc Bencs; Péter Csikvári (Eur. J. Comb., 2023)

Permutation Tutte polynomial. - Csongor Beke; Gergely Kál Csáji; Péter Csikvári; Sára Pituk (Eur. J. Comb., 2024)