Péter Csikvári

According to our database, Péter Csikvári authored at least 29 papers between 2009 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Upper bound for the number of spanning forests of regular graphs.

Ferenc Bencs, Péter Csikvári

Eur. J. Comb., May, 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., May, 2023

On Sidorenko's conjecture for determinants and Gaussian Markov random fields.

Péter Csikvári, Balázs Szegedy

Random Struct. Algorithms, March, 2023

On complex roots of the independence polynomial.

Ferenc Bencs, Péter Csikvári, Piyush Srivastava, Jan Vondrák

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Markov Random Fields, Homomorphism Counting, and Sidorenko's Conjecture.

Péter Csikvári, Nicholas Ruozzi, Shahab Shams

IEEE Trans. Inf. Theory, 2022

Evaluations of Tutte polynomials of regular graphs.

Ferenc Bencs, Péter Csikvári

J. Comb. Theory, Ser. B, 2022

2021

On the Number of Forests and Connected Spanning Subgraphs.

Márton Borbényi, Péter Csikvári, Haoran Luo

Graphs Comb., 2021

Some Applications of Wagner's Weighted Subgraph Counting Polynomial.

Ferenc Bencs, Péter Csikvári, Guus Regts

Electron. J. Comb., 2021

2020

Counting degree-constrained subgraphs and orientations.

Márton Borbényi, Péter Csikvári

Discret. Math., 2020

Covers, Orientations and Factors.

Péter Csikvári, András Imolay

Electron. J. Comb., 2020

2019

Counting Homomorphisms in Bipartite Graphs.

Shahab Shams, Nicholas Ruozzi, Péter Csikvári

Proceedings of the IEEE International Symposium on Information Theory, 2019

2017

The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph.

Emma Cohen, Péter Csikvári, Will Perkins, Prasad Tetali

Eur. J. Comb., 2017

Chromatic roots and limits of dense graphs.

Péter Csikvári, Péter E. Frenkel, Jan Hladký, Tamás Hubai

Discret. Math., 2017

Graphs with integer matching polynomial zeros.

Saieed Akbari, Péter Csikvári, A. Ghafari, S. Khalashi Ghezelahmad, Mina Nahvi

Discret. Appl. Math., 2017

Sidorenko's Conjecture, Colorings and Independent Sets.

Péter Csikvári, Zhicong Lin

Electron. J. Comb., 2017

2016

Benjamini-Schramm continuity of root moments of graph polynomials.

Péter Csikvári, Péter E. Frenkel

Eur. J. Comb., 2016

Graphs with Integer Matching Polynomial Roots.

Saieed Akbari, Péter Csikvári, A. Ghafari, S. Khalashi Ghezelahmad, Mina Nahvi

CoRR, 2016

2015

Homomorphisms of Trees into a Path.

Péter Csikvári, Zhicong Lin

SIAM J. Discret. Math., 2015

2014

Graph Homomorphisms between Trees.

Péter Csikvári, Zhicong Lin

Electron. J. Comb., 2014

2013

On a Poset of Trees II.

Péter Csikvári

J. Graph Theory, 2013

Note on the Smallest Root of the Independence Polynomial.

Péter Csikvári

Comb. Probab. Comput., 2013

2012

Two remarks on the adjoint polynomial.

Péter Csikvári

Eur. J. Comb., 2012

The Density Turán Problem.

Péter Csikvári, Zoltán Lóránt Nagy

Comb. Probab. Comput., 2012

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

2011

On the roots of edge cover polynomials of graphs.

Péter Csikvári, Mohammad Reza Oboudi

Eur. J. Comb., 2011

Applications of the Kelmans Transformation: Extremality of the Threshold Graphs.

Péter Csikvári

Electron. J. Comb., 2011

2010

On a poset of trees.

Péter Csikvári

Comb., 2010

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 conjecture of V. Nikiforov.

Péter Csikvári

Discret. Math., 2009