default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPéter Csikvári
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Csongor Beke, Gergely Kál Csáji, Péter Csikvári, Sára Pituk:
Permutation Tutte polynomial. Eur. J. Comb. 120: 104003 (2024)- 2023
- [j26]Ferenc Bencs, Péter Csikvári:
Upper bound for the number of spanning forests of regular graphs. Eur. J. Comb. 110: 103677 (2023) - [j25]Csongor Beke, Gergely Kál Csáji, Péter Csikvári, Sára Pituk
:
Short proof of a theorem of Brylawski on the coefficients of the Tutte polynomial. Eur. J. Comb. 110: 103678 (2023) - [j24]Péter Csikvári, Balázs Szegedy:
On Sidorenko's conjecture for determinants and Gaussian Markov random fields. Random Struct. Algorithms 62(2): 335-375 (2023) - [c2]Ferenc Bencs, Péter Csikvári, Piyush Srivastava, Jan Vondrák:
On complex roots of the independence polynomial. SODA 2023: 675-699 - 2022
- [j23]Ferenc Bencs, Péter Csikvári:
Evaluations of Tutte polynomials of regular graphs. J. Comb. Theory B 157: 500-523 (2022) - [j22]Péter Csikvári, Nicholas Ruozzi, Shahab Shams:
Markov Random Fields, Homomorphism Counting, and Sidorenko's Conjecture. IEEE Trans. Inf. Theory 68(9): 6052-6062 (2022) - [i2]Ferenc Bencs, Péter Csikvári, Piyush Srivastava, Jan Vondrák:
On complex roots of the independence polynomial. CoRR abs/2204.04868 (2022) - 2021
- [j21]Ferenc Bencs, Péter Csikvári, Guus Regts:
Some Applications of Wagner's Weighted Subgraph Counting Polynomial. Electron. J. Comb. 28(4) (2021) - [j20]Márton Borbényi, Péter Csikvári, Haoran Luo:
On the Number of Forests and Connected Spanning Subgraphs. Graphs Comb. 37(6): 2655-2678 (2021) - 2020
- [j19]Péter Csikvári, András Imolay:
Covers, Orientations and Factors. Electron. J. Comb. 27(3): 3 (2020) - [j18]Márton Borbényi, Péter Csikvári:
Counting degree-constrained subgraphs and orientations. Discret. Math. 343(6): 111842 (2020)
2010 – 2019
- 2019
- [c1]Shahab Shams, Nicholas Ruozzi, Péter Csikvári:
Counting Homomorphisms in Bipartite Graphs. ISIT 2019: 1487-1491 - 2017
- [j17]Péter Csikvári, Zhicong Lin:
Sidorenko's Conjecture, Colorings and Independent Sets. Electron. J. Comb. 24(1): 1 (2017) - [j16]Saieed Akbari, Péter Csikvári, A. Ghafari, S. Khalashi Ghezelahmad, Mina Nahvi:
Graphs with integer matching polynomial zeros. Discret. Appl. Math. 224: 1-8 (2017) - [j15]Péter Csikvári, Péter E. Frenkel, Jan Hladký, Tamás Hubai:
Chromatic roots and limits of dense graphs. Discret. Math. 340(5): 1129-1135 (2017) - [j14]Emma Cohen, Péter Csikvári, Will Perkins, Prasad Tetali:
The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph. Eur. J. Comb. 62: 70-76 (2017) - 2016
- [j13]Péter Csikvári, Péter E. Frenkel:
Benjamini-Schramm continuity of root moments of graph polynomials. Eur. J. Comb. 52: 302-320 (2016) - [i1]Saieed Akbari, Péter Csikvári, A. Ghafari, S. Khalashi Ghezelahmad, Mina Nahvi:
Graphs with Integer Matching Polynomial Roots. CoRR abs/1608.00782 (2016) - 2015
- [j12]Péter Csikvári, Zhicong Lin:
Homomorphisms of Trees into a Path. SIAM J. Discret. Math. 29(3): 1406-1422 (2015) - 2014
- [j11]Péter Csikvári, Zhicong Lin:
Graph Homomorphisms between Trees. Electron. J. Comb. 21(4): 4 (2014) - 2013
- [j10]Péter Csikvári:
Note on the Smallest Root of the Independence Polynomial. Comb. Probab. Comput. 22(1): 1-8 (2013) - [j9]Péter Csikvári:
On a Poset of Trees II. J. Graph Theory 74(1): 81-103 (2013) - 2012
- [j8]Péter Csikvári, Katalin Gyarmati, András Sárközy:
Density and ramsey type results on algebraic equations with restricted solution sets. Comb. 32(4): 425-449 (2012) - [j7]Péter Csikvári, Zoltán Lóránt Nagy:
The Density Turán Problem. Comb. Probab. Comput. 21(4): 531-553 (2012) - [j6]Péter Csikvári:
Two remarks on the adjoint polynomial. Eur. J. Comb. 33(4): 583-591 (2012) - 2011
- [j5]Péter Csikvári:
Applications of the Kelmans Transformation: Extremality of the Threshold Graphs. Electron. J. Comb. 18(1) (2011) - [j4]Péter Csikvári, Mohammad Reza Oboudi:
On the roots of edge cover polynomials of graphs. Eur. J. Comb. 32(8): 1407-1416 (2011) - 2010
- [j3]Péter Csikvári:
On a poset of trees. Comb. 30(2): 125-137 (2010)
2000 – 2009
- 2009
- [j2]Péter Csikvári:
On a conjecture of V. Nikiforov. Discret. Math. 309(13): 4522-4526 (2009) - [j1]Péter Csikvári, Péter Fürjes, Csaba Dücso, István Bársony:
Micro-hotplates for thermal characterisation of structural materials of MEMS. Microelectron. J. 40(9): 1393-1397 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
